Follow the graph

and do dry run of Dijistra's Algorithm given in the picture. (Below is a visual example of How Dijistra's Algorithm takes advantage priority of the priority queue data structure to find shortest path in a graph.)

Questions weight 20/marks so kindly explain well in a details.

Given Adjacency list - Vester ol Verten 1 2 3 4 5 Verter I 4 Verten 31 Vertex 46 Vertex 6 5 The directed graph of the of the above adjacency list as follows- is 2 6 Dijkstra(v1) 3 6 Shortest paths 1 OLE 3 K5 17 1 04 Vertex Dist Prev 2 VO v1 4 V1 0 -1 Priority Queue: V2 5 vo V3 00 v5 14 6 VO V5 7 VE V6 6 v2 Google Slides Given Adjacency list - Vester ol Verten 1 2 3 4 5 Verter I 4 Verten 31 Vertex 46 Vertex 6 5 The directed graph of the of the above adjacency list as follows- is 2 6 Dijkstra(v1) 3 6 Shortest paths 1 OLE 3 K5 17 1 04 Vertex Dist Prev 2 VO v1 4 V1 0 -1 Priority Queue: V2 5 vo V3 00 v5 14 6 VO V5 7 VE V6 6 v2 Google Slides