Consider the following acyclic graph that is implemented by using adjacency lists. Assume the adjacency lists are in sorted order, for example, when iterating through the edges pointing from vertex 3, visit edge (a, b) before edge (a, d). (a) Run breadth-first search (BFS) on the graph to visit all the vertices, starting from vertex 3. List the vertices in the order that they are visited. (b) Run depth-first search (DFS) on the graph to visit all the vertices, starting from vertex 3. List the vertices in the order that they are visited