[10 pts] Perform DFS on this graph or its inverse graph, always visited the first unvisited node in alphabetical order (regardless of edge length). Part A: [2 pts] Find the discovery and finish times of the nodes. Solution: Part B: [2 pts] Classify the edges as T (tree), F (forward), B (back), or C (cross) edges Solution: Part C: [2 pts] Draw the stack used in Kosaraju's algorithm in the following array: Part D: [2 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 following the rules for Kosaraju's algorithm (starting from top of stack). Solution