Q:Question:3. Consider the following graph Show how depth-first search works on the above graph. 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, and show the classification of each edge. What is the time complexity of depth-first search algorithm?A:Answer:See a step by step answer