This question is about algorithms, using depth-first search.

Show how depth first search works using figure 22.4 as a guideline for how to show the result of the depth first search. It is only necessary to show the last step. Also, show non-edges, but do not label them as done in that figure (do not label edges as back, cross, or forward edges). Assume that the for loop of lines 5-7 of the DFS procedure considers the vertices in alphabetical order, and assume that each adjacency list is ordered alphabetically. Show the discovery and finishing times for each vertex. DFS (G) for each vertex mu Element G.V u. color = WHITE U .pi = NIL time = 0 for each vertex u Element G.V if u. color