(Solved): Q1 (18 points) A directed graph G is shown in Figure 1. Assume that the adjacency lists are in alp ...

Q1 (18 points) 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-lo op of DFS, check the vertices in alphab etical order. Figure 1: Graph for Q1. (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. Q1: Read the instructions for question Q1 in the assignment document. For each of the three sub-questions, write your answer to the question in the given space. (a): After the DFS on $$G$$, the discovery times for vertices $$B,J,K$$ are B.d $$d=$$ $$J.d=$$ $$K?d=$$ (b): After the DFS on $$G$$, the finish times for vertices $$A,C,F$$ are $$A?f=$$ $$C.f=$$ $$F.f=$$ (c): After the DFS on $$G$$, th predecessors for vertices $$D,H,K$$ are $$D.?=$$ $$H.?=$$