Show how DFS works on the graph given below. Assume that the for loop of lines 57 of the DFS procedure considers the vertices in alphabetical order, and assume that each adjacency list is ordered alphabetically. You must show the discovery and finishing times for each vertex, and show the classification of each edge, i.e., whether the edge is tree edge, back edge, etc.

X Z y S t r