Please show all the work

Consider the following graph: B 5 3 2. 0 2 4 Start with node s and apply the Dijkstras algorithm step by step. (a) Show the priority queue at each step of traversing a node. (b) Also, show final paths from node 's' to every other reachable node. (Hint: first solve by hand by dry running the algorithm and noting down queue contents, and then write the solution on computer) An example solution with starting node = 'A' is as below: Dijkstra's Shortest Paths: A-> B (Path length/cost: 1) A-> B>D-> (Path length/cost: 2) A->B-> D (Path length/cost: 1) Priority Queue (Step-by-step): Step Dequeued node 0 1 2 3 4 A B D t Priority queue [A 0] B1 D 1],[t 41 [t 2] >