Topic: Dijkstra's Algorithm

Draw/provide individual figure for each step of the simulation. The programming code is NOT NEEDED but rather draw the simulation. Also show the state of the graph (by providing individual figure) at each step of the simulation.

01 b) complexity Hanoi problem In both cases formulate recursive solutions and show all your works. 2. Apply Dijkstras algorithm on the following graph. Show all the steps. F B 15 5 10 1 A 12 Start D E 2 15 10