Write Dijkstra’s algorithm and explain how does it work. Use the algorithm to find the length of a shortest path between the vertices A and F in the weighted graph shown in Figure 1. Show all the intermediate steps.