1. Consider the following graphs: a. Step through Dijkstra's algorithm to calculate the single-source shortest paths from A to every other vertex. Show your steps in the table below. Cross out old values and write in new ones, from left to right within each cell, as the algorithm proceeds. Also list the vertices in the order which you marked them known. Finally, indicate the lowest-cast path from node A to node G. A G 14 3 10 E F B D-5 H Known vertices (in order marked known): Vertex Known Distance Path