Please Help. Answer typed preferred.

6. Show how depth-first search works on the graph in Figure 2. Assume that the for loop of the DFS procedure considers the vertices in ascending numerical order (that is, start with vertex 1). Show the discovery and finishing times for each vertex, and show the classification of each edge. Figure 2