Using the digraph in Figure 7.29 (Page 377), apply the strongComponents algorithm (Page 361), based on the following assumptions: (1) Assume the vertices are indexed in REVERSE alphabetical order (so you must start at I). You must show your work in detail. Specifically, show the following FOUR structures: In Phase 1, draw the original graph (only once!), and annotate each vertex with the discoverTime/finishTime numbers. Show the contents of the finishStack when Phase 1 is completed. In Phase 2, draw the transpose graph (once), and annotate each vertex with the discoverTime/finishTime numbers. Finally, draw the condensation graph. CAUTION: Note that you should be using dotted lines representing the original edges for this very last part, NOT the 'backward' edges in the transpose graph! See Figure 7.20c on Page 358 to see how you should label the rectangular notes in the condensation graph. Make sure you understand the role of the finishStack; if you ignore it in Phase 2, you're GUARANTEED to get a wrong answer.

Figure 7.29 Digraph for Exercises 7.1 and 7.23 Figure 7.29 Digraph for Exercises 7.1 and 7.23