Show how depth first search works on the graph of Figure 22.6 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. Please make sure that you use the format of figure 22.4 to show how depth first search works on graph of figure 22.6.

Figure 22.6 A directed graph for use in Exercises 22.3-2 and 22.5-2. DFS (G) 1 for each vertex u E G. V 2 color WHITE 4 time 0 5 for each vertex u E G. V Assume yot ths considem the if u, color WHITE DFS-VISIT (G,u) DFS-VISIT(G.u) 1 time time 1 ll white vertex u has just been discovered 2 u time 3 u color GRAY 4 for each v e G.Adilu ll explore edge (a,v) 5 if v, color WHITE DFS-VISIT (G.) 8 u. color BLACK ll blacken u; it is finished 9 time time 1 10 u time are explored by the alporihm they are he an either if they otherwise) No tree acording whether they bak