Need C++ code or algorithm if necessary

Need in 1 hour.

Add-ins Media Links Comments Header & Footer Question 06 15+5=10 Marks] Problem statement: Consider the following graph: B 5 2 0 1 D 4 Start with nodes and apply the Dijkstra's 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-> (Path length/cost: 1) A->B->D->t (Path length/cost: 2) A-> B -> D (Path length/cost: 1) Priority Queue (Step-by-step): Dequeued node Step 0 1 2 3 Priority queue [AO] [B 1] [D 1), [t 4] [t 2) > B D 4 t