Q:Question:on how we can traverse and construct the bfs tree For the graph shown in Fig. Q.2A, starting at vertex ' a ' and resolving ties by the vertex alphabetical order, traverse the graph by breadth-first search and construct the corresponding breadth-first search tree, showing all types of edges. Give the order in which the vertices were reached for the first time. Fig. Q.2AA:Answer:See a step by step answer