Problem 4: Step through Dijkstras algorithm to calculate the single-source shortest paths from A to every other vertex. Show your steps. 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 F 12 9 3 10