Suppose Dijkstra's algorithm is run on the following graph, starting at node S. Draw the trace of Dijkstra's algorithm showing the intermediate distance values of all nodes at each step of the algorithm. Show the final shortest path. Use Kosaraju-Sharir algorithm to find the strongly connected components in the graph shown below. Whenever there is a choice of vertices to explore, always pick the one that is alphabetically first. Show each step clearly starting from the adjacency list representation to the final connected components. Suppose Dijkstra's algorithm is run on the following graph, starting at node S. Draw the trace of Dijkstra's algorithm showing the intermediate distance values of all nodes at each step of the algorithm. Show the final shortest path. Use Kosaraju-Sharir algorithm to find the strongly connected components in the graph shown below. Whenever there is a choice of vertices to explore, always pick the one that is alphabetically first. Show each step clearly starting from the adjacency list representation to the final connected components