9. DFS and BFS (5 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) (1 point) Execute a Breadth-First Search on the graph G1, starting on vertex a. Specify the visit times for each node of the graph a b cd e f Visit (2) (2 points) Execute a Depth-First Search on the graph G1, starting on vertex a. Specify the visit and finish times for each node of the graph a b cd e f Visit: Finish: (3) (1 point) Which edge or edges would you remove to make Gi into a directed acyclic graph (i.e., DAG)? (4) (1 point) Suppose that you were given a graph with 10,000 edges. You want to find a particular vertex in the graph and you know the length of some path from your starting vertex to the node is at most 5 Circle which search would likely find the vertex faster: 1) BFS 2) BFS and DFS are the same 3) DFS 4) Neither search will find the vertex Justify your choice briefly