Q:Question:[1 pts]. Performing DFS starting at node A, a) What is the topological sort of the following graph? Draw the final topological sort. Remember that the topological sort is the decreasing ending times of the DFS traversal. When doing the traversal, follow the nodes in alphabetical order b) If we add the directed edge C to G to the graph above (6.a), what is the new topological sort of the resulting graph?