I am learning about depth first search and need help understanding this practice problem

Show how the depth- first search Works on the graph in the fisure below. Assume that the for loop of the DFS Procedure considers the vertices in Ascending numerical order (that is start with vertex 7). Show the discovery and finishing times for each vertex, and show the classification of each edze. 8 11 7 12 TO