Please reply to both answer. Thank you! Step by Step Solution

1. Consider the following weighted directed graph 12 15 17 2. Run Dijkstra's single source shortest path algorithm on the above digraph using C as the 13 source. Give the order in which the vertces are removed from the priority queue. Note that A is not reachable from C, so it is never added (and thus never removed) from the pri ority queue. 16 10 14 Give the distance of the shortest path from Cto each vertex v (except A and C) and the last edge on the shortest path to v. Put your answers for the edgeTo column in the form A-> C. distTo edgeTolv] A infinity nul COl End of document