With vertex $4$ as the source $($starting point$),$ use the Dijkstra's Algorithm to determine the

shortest path to all the vertices in the graph shown below. You must use stepwise approach

and show all the intermediate steps as you work through the Dijkstra's Algorithm.