5. Show how the procedure STRONGLY-CONNECTED-COMPONENTS works on the following graph. Specifically, show the finishing 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. (from the textbook problem 22.5-2)