9. (15 pts, 5 pts for each, NOT COVERED) Consider a DFS traversal on the graph in Figure 1. Assume that the DFS traversal con- siders the vertices in alphabetical order, and each adjacency list is ordered alphabetically. So, the DFS traversal starts with vertex q. Please answer the following questions. Figure 1: A directed graph (1) Label the discovery and finishing times for each vertex. (2) Mark the type of each edge. (Recall that there are four types of edges: tree, back, forward, cross) (3) After removing edges , , and , it becomes loop-free (i.e., acyclic). Please give a topological order of the vertices according the DFS traversal