Simulate the breadth-first search (BFS) reachability algorithm on the following graph, starting at node A. For this problem, NODES MUST BE ADDED TO THE STACK/QUEUE IN CLOCKWISE ORDER starting at the node directly above. Note that in this version, we do not add neighbors to the stack/queue/priority queue if they have already been visited. What is the correct order in which the nodes are marked 'reachable'? A D O A, D, B, C, E O A, B, C, D, E None of the other statements are correct. O A, B, D, E, C B O A, B, E, C, D E