I'm learning about dfs and how to apply it based on this practice I am having trouble with.

Show how the depth first search Works on the graph in the figure below. Assume that the for loop of the DFS Procedure considers the vertices in alphabetical order (that is start with vertex I). Show the discovery and finishing times for each Vertex, and show the classification of each edge. 1 J m ok