List the vertices in the order they are visited in a Breadth First Search that starts at vertex B. (Assume that BFS processes vertices alphabetically, when given the option of multiple vertices to explore.) Draw the spanning tree resulting from BFS.