2. Consider the directed graph below. When I say "do a heuristic DFS of the graph", use edge ength as the heuristic and break ties alphabetically Part A: Find the discovery and finish times of the nodes Node Discovery Time Finishing Time Part B: Classify the edges as T (tree), F (forward), B (back), or C (cross) edges Edge AB AC AD BD BE CA CF DB DC DE DF DG EG FD GE Part C: Here's the graph G' (G with the edge directions reversed). Show the discovery times and finish times of the nodes when you do a heuristic DFS Node Discovery Time Finishing Time Part D [5 pts]: List the SCCs. (You may not need all the lines.) SCCs