Consider the graph G below. Apply DFS to the graph G. Assume that vertices are listed in alphabetical order in each adjacency list. In addition, consider that the vertices are taken in the alphabetical order in the main loop of the DFS algorithm Write discovery/finish times for each vertex Write the edge classification. Write the depth first forest obtained. Follow the example from the notes. Upload a file with your solution