Find the Shortest Path for this Graph using Dijkstra’s Algorithm:

The shortest path for this graph is 0,1,2,4,3.