Given the following undirected, weighted graph.

(a) Step through Dijkstra's algorithm to calculate the single-source shortest paths from vertex A to every other vertex by filling in the table as done in class. Cross out old values and write in new ones, from left to right, as the algorithm proceeds.

(b) Write down the order in which Dijkstras algorithm would mark each node as known.

(c) Write down the shortest (weighted) path from A to L and its length (weighted cost).

(d) Draw the path thus obtained.

A 5 B 9 K F E 6 8 3 J G 8 2 1 2 D H