Perform Dijkstra's algorithm on the graph below to find the minimum-weight paths from the source vertex a to all other vertices. Fill out the table shown below. Set S contains vertices in the order of vertices removed from the min priority queue Q. Finally, reconstruct the path from vertex a to vertex e and give the total cost of the path. Consider alphabetic order for EXTRACT-MIN (Q) with same weight. D P 3 3 8 Path from a to e: Cost: 5 4 b (V) 4 Vertex Previous (л[V]) Cost from source (d[v]) e S d[v]

Perform Dijkstra's algorithm on the graph below to find the minimum-weight paths from the source vertex a to all other vertices. Fill out the table shown below. Set S contains vertices in the order of vertices removed from the min priority queue Q. Finally, reconstruct the path from vertex a to vertex e and give the total cost of the path. Consider alphabetic order for EXTRACT-MIN (Q) with same weight. D P 3 3 8 Path from a to e: Cost: 5 4 b (V) 4 Vertex Previous (л[V]) Cost from source (d[v]) e S d[v]