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

(b) Dijkstras 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 Dijkstras algorithm computes the incorrect shortest path for one or more of the vertices.

7 10 4 8