1) [7 pts] Consider the directed graph below. Do DFS on this node. When you have the choice of two or more nodes to visit next, choose the nearest one. In case of a tie for the nearest, break ties alphabetically Part A: [2 pts] Find the discovery and finish times of the nodes. List them in the table below Solution Node Discovery Time Finishing Time Part B2 pts] Classify the edges as T (tree), F (forward), B (back), or C (cross) edge:s Solution Edge AB AC AD BD |BE CA CF IDB DC DE DF I DG EG FD GE Part C:l2 pts] Here's the graph G' (G with the edge directions reversed). Show the discovery times and finish times of the nodes when you do DFS. Search this graph in order from ABDEGCF (reverse order of finish times) Solution: Node Finishing Time Part D [1 pts]: List the SCCs. (You may not need all the lines.) Solution: SCCs