(Solved): 1. Calculate a depth-first search of the following directed graphs using the "alphabetical order" c ...

1. Calculate a depth-first search of the following directed graphs using the "alphabetical order" convention for vertices and edges. For both graphs, draw the resulting DFS tree. For the first graph, indicate the type (back, forward, or cross) of the remaining edges. For the second graph (which is acyclic), write down the pre-and post-order traversals of the DFS. Use that information to calculate a topological sort of the graph. (Note: given the way that this problem is phrased, there is only one acceptable DES tree for each graph, and only one acceptable topological sort)