Run BFS on the graph below, starting in node a. Whenever you have a choice which vertex to visit next, choose the next vertex in the adjacency list of the vertex (e.g., when you have reached node e, you must first try to visit node f, then g, and then c). Indicate the outcome of the algorithm by labeling the nodes with two numbers; the first number indicates the order in which the nodes are visited, and the second number indicates the level of the node (i.e., its distance from a). For example, a is labeled (1, 0). c la