Select all that apply. Which of the following are true statements about recursion? Recursive algorithms could potentially solve the same problem multiple times. Recursion can be implemented with a pure iterative solution. Recursive algorithms are generally more elegant than their iterative counterpart. Recursion requires more memory. Question 3 Select all that apply. When debugging a recursive method, which of the following are questions to be asked to try to determine the error? Are all cases of a problem considered? Does the recursive method have an iterative loop in it? Have you covered all possible base cases? If the recursive method has a return value, are you returning a value for each case? Which of the following is an example of indirect recursion? Method A calls method A, Method B calls method B Method A calls method B, Method B calls method B Method A calls method B, Method B calls Method A Method A calls method B, Method B calls method C Question 5 1 pts The following is pseudocode for a minmax tree. True or false, this is an example of mutual recursion. function maximizer(state) if terminal(state) return utility(state) best-score = -infinity for action in actions(state) new-state = perform-action(state, action) score = minimizer(new-state) if score > best-score best-score = score return best-score function minimizer(state) if terminal(state) return utility(state) best-score = infinity for action in actions(state) new-state = perform-action(state, action) score = maximizer(new-state) if score