Figure 1 A B Q T C K P. S E N R a. Write the sequence of nodes from A to O if the breadth-first search algorithm is applied on the tree in Figure 1. Your answer b. List the nodes in the Open List when the goal is found using this algorithm. Your answer c. Write the sequence of nodes from A to O if the depth-first search algorithm is applied on the tree in Figure 1. Your answer d. List the nodes in the Open List when the goal is found using this algorithm. Your answer e. What makes the depth-first search better than the breadth-first search in this problem? Its ability to backtrack. The nature it works by exploring the nodes in sequence. The steps it takes to reach the goal which is fewer than the breadth-first search. O The location of the goal which can be reached faster by the depth-first search