start at time 1

here is an example problem

vertices are given in alphabetical order for question 2 above

2. (15 pts) A directed graph G is shown in Fig. 2. Assume that the vertices are listed in al- phabetical order in each adjacency list. Apply depth first search (DFS), assuming that the vertices are given in alphabetical order, to compute the Discovery Time, PARENT, and Finish Time for each vertex. Write the result in the following table (12 pts) Figure 2: VERTEX Discovery Time Finish Time PARENT Draw the DFS trees (3 pts