6,7,8,and 9 please!

Figure 1: Digraph (two copies) for homeworks 2.062.09. Think about why two copies are shown. Homework 2.062.09 Find the strongly connected components of the graph shown twice in Figure 1 by carefully following the steps of the SCC algorithm due to Sharir, as presented in lectures and found in the optional texts (excerpts in Handouts). You will make two assumptions about the order of traversals, as stated below. Be sure to show any important data structures computed by the SCC algorithm. Also show the discovery times and finishing times. Also heavy-line the tree edges and circle the tree roots of both depth-first searches. Indicate the SCCs and where they were found, preferably by circling them in the appropriate picture. 2.06: Traverse the vertices in alphabetical order for the first DFS and assume the adjacency lists are also in alphabetical order (A, B, C, D, E, F, G, H). 2.07: Traverse the vertices in reverse alphabetical order for the first DFS and assume the adjacency lists are also in reverse alphabetical order (H, G, F, E, D, C, B, A). 2.08: Identify the SCC leaders found in 2.06 and 2.07. Are they the same? Briefly explain how you identified them. 2.09: Finally, draw the component graph(s), also called condensation graphs, for 2.06 and 2.07. Are they the same