$($b$)$ Consider the following weighted directed graph: Assuming V$1$ is the source vertex show the action of Dijkstra$$s algorithm when applied to the above graph by showing a step by step list of vertices for which the shortest routes have been obtained and the array of the distances from the source vertex to the other vertices.