(Solved): 3. Queue Based Shortest Path (15 Points) at node A. Draw the trace of Bellman-Ford algorithm showin ...

3. Queue Based Shortest Path (15 Points) at node A. Draw the trace of Bellman-Ford algorithm showing the intermediate distance values of all nodes after each iteration of the algorithm. Show the contents of the queue and the vertex being considered at each step. Show the final shortest path. Use the tables on the next sheets to show the distance to and the edge as you develop the shortest path. Show the final path and distances on the next sheet. Whenever there is a choice of vertices to explore, always pick the one that is alphabetically first. 5 4 6 3 ? 3 E -2 3 6 L F H 5 K