A directed graph G is shown in Figure 1. Assume that the adjacency lists are in alphabetical order. Apply depth-first search (DFS) on graph G. In the main-loop of DFS, check the vertices in alphabetical order. A B D J F Figure 1: Graph for Q1. H K (a) On the answer sheet, enter the discovery times of selected vertices computed by the DFS. (b) On the answer sheet, enter the finish times of selected vertices computed by the DFS. (c) On the answer sheet, enter the predecessors of selected vertices computed by the DFS. Q2 (6 points) Use the method taught in class to compute the transpose graph G of G shown in Figure 1. On the answer sheet, answer the questions regarding the adjacency lists of GT. Assume that the adjacency lists of GT are in alphabetical order. Ac Go