$[5$ points$]$ Consider the following graph.

Step through Dijkstra's algorithm to calculate the single$-$source shortest paths from A to every other vertex. Show your steps in a table. Cross out old values and write new ones, from left to right within each cell, as the algorithm proceeds. Finally, indicate the lowest$-$cost path from node $A$ to node $H.q,$

$\backslash$table$[[$Vertex$,$Known?,Cost,Path$],[,,,],[,,,],[,,,],[,,,],[,,,]]$

$[2$ points$]$ For the graph in Q$10$ above, draw the minimum spanning tree produced by Kruskal's algorithm.