Consider the following graph: Start with node s and apply the Dijkstra’s algorithm step by step. Show the priority queue at each step of traversing a node. Also, show final paths (along with the path...

Consider the following graph:

Start with node s and apply the Dijkstra’s algorithm step by step.

1. Show the priority queue at each step of traversing a node.


2. Also, show final paths (along with the path length) from node ‘s’ to every other reachable node.