Algorithms and Data Structures

1. (20 pts) Show that how DFS works on the following graph. Assume that both the for-loop of lines 5-7 of the DFS procedure and the for-loop of lines 4-7 of the DFS-VISIT procedure consider the vertices in the reversed alphabetical order, i.e., consider z first, then y, and so on. 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