solve this quickly. Time is too short

Problem statement: Consider the following graph: B 5 3 $ 2 0 N c D 4 Start with node s 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 -> B (Path length/cost: 1) A->B->D->t(Path length/cost: 2) A-> -> D (Path length/cost: 1) Priority Queue (Step-by-step): Step Dequeued node 0 1 A 2 B 3 D 4 Priority queue [AO] B] DI].[t4) t 2) > t