3. DFS and BFS (6 points) For the following problems, assume that vertices are ordered alphabetically in the adjacency lists (thus you will visit adjacent vertices in alphabetical order). (1) (2 points) Execute a Breadth-First Search on the graph G1, starting on vertex a. Specifiy the visit times for each node of the graph. (2) (2 points) Execute a Depth-First Search on the graph G, starting on vertex a. Specifiy the visit and finish times for each node of the graph (a) (1 point) For each edge in your graph identify whether it is a tree edge, back edge, forward edge, or a cross edge. (b) (1 point) Which edges would you remove to make your graph into a DAG? (hint: use your edge classification to justify your choice)