Problem 5) (20 points)

(10 points) Run Dijkstras algorithm on the following graph starting from vertex A. Show the relaxation of edges and the open list at each step.

Problem 5) (20 points) (a) (10 points) Run Dijkstra's algorithm on the following graph starting from vertex A. Show the relaxation of edges and the open list at each step. 8 10 (b) (10 points) Dijkstra's algorithm described in the book only works for edges with positive weights (even without negative cycles the algorithm could still fail). Show an example by drawing a graph with negative weights but NO negative cycles such that Dijkstra's algorithm computes the incorrect shortest path for one or more of the v