Figure 2 shows a directed graph G. Assume that the adjacency list lists the edges in alphabetical order Figure 2: Graph for P3 1. Apply depth first search (DFS) to graph G, and show the discovery and finish times of each vertex. In the main-loop of DFS, check the vertices in alphabetical order. You can write the results on the graph in Figure:2 2. Draw the transpose graph GT of the graph in Figure 2. The vertices are given for your convenience 3. Apply DFS to GT to compute the strongly connected components. You need to show the strongly connected components and indicate the order they are computed