20.52 Show how the procedure STRONGLY-CONNECTEDCOMPONENTS works on the graph of Figure 20.6. Specifically, show the finish times computed in line 1 and the forest produced in line 3. Assume that the loop of lines 5-7 of DFS considers vertices in alphabetical order and that the adjacency lists are in alphabetical order. Figure 20.6 A directed graph for use in Exercises 20.3-2 and 20.5-2