$3.$ You are going to simulate dijkstra's algorithm in the question. Source is node $1,$ sink is node $3.(20\backslash \%)$

You should show all intermediate steps, including the distance vector and previous vector, clearly. You also need to find out the shortest distance and show how the shortest path is identified from the vectors.

Note: If there are multiple options, you should always select the node with the smallest numeric value.