Q5. [40] Single Source Shortest Path in the DAG

5.1) [15] Sort the vertices in the topological order starting from q and give its list.

5.2) [10] Redraw the graph by arranging the vertices in the sorted order.

5.3) [15] Find the shortest path from a vertex q to each vertex. You have to show the proper

steps of edge relaxations, updating a key, D[v] of each vertex v, v V(G2).

In the given modified Directed Acyclic Graph (DAG) G2, 4 1 6 7 8 2 6 4 4 3 2. V W -1 |-2 3 In the given modified Directed Acyclic Graph (DAG) G2, 4 1 6 7 8 2 6 4 4 3 2. V W -1 |-2 3