When,in a Recursive Solution,function a Calls Function B Which,in Turn,calls

Q18: A problem can be solved with recursion

Q19: A recursive function must have some way

Q20: A problem can normally be solved with

Q21: The base case is the case in

Q22: Which would be the base case in

Q24: Recursion is<br>A) never required to solve a

Q25: Recursive function calls are _ efficient than

Q26: What defines the depth of recursion?<br>A) the

Q27: A recursion in which a function directly

Q28: Which of the following describes the base