Consider this directional graph below in Figure 4. Use Dijkstras algorithm to find the shortest path from node v3 to v5. Write down the steps.

Consider this directional graph below in Figure 4. Use Dijkstra's algorithm to find the shortest path from node v3 to v5. Write down the steps. Do you have any comments on the result? V1 V2 2 5 V4 V5 V3 V6 5