Algorithm: STRONGLY-CONNECTED-COMPONENTS (G) 1. call DFS (G), to compute the finish time f[u] of each vertex u 2. compute G. 3. call DFS (G), but in the main loop of DFS, consider the vertices in order of decreasing f[u]. (as computed in line 1 ) 4. Output the vertices of each tree in the depth-first forest formed in line 3 as a separate strongly connected component. 5. Show how the procedure STRONGLY-CONNECTED-COMPONENTS works on the graph of Figure 1. Specifically, show the finishing times computed by DFS in line 1 and the forest produced in line 3 . Assume that the adjacency lists are in alphabetical order. Figure 1. Graph for Strongly Connected Components