Algorithms

Depth-First Search

Suppose you use depth-first search to find a path from state c to state m. Assume that states are added to the queue in reverse alphabetical order (i.e., if we are expanding state g, we would add k to the queue, then add fto the queue) and we keep track of visited states so we do not backtrack. What would the resulting path be? (include c and m in your answer) 1) c Choose... 3) Choose # Choose Choose... 6) Choose