Instructions:

Reproduce the behavior of the BFS algorithm for the graph below. Just click on the edges in the order that they will be traversed by the BFS algorithm. Start with Node A. If there is more than one node that could be visited next, choose the one that comes first in alphabetical order.

Score: 0 / 6, Points remaining: 6, Points lost: 0