Answer Happy

True False
comment required
22. It is proper for a recursion to run on without ending. 23. A proper recursive solution requires at least two cases: a recursive function that calls the recursive function with a smaller problem, and a base, or stopping case. 24. A recursive function must not return a value. 25. A recursive function can have local variables. 26. A recursive function can have only one recursive case. 27. Each activation frame contains all the function's code, as well as the automatic variables and formal parameters 28. The activation frames in nested function calls are handled in a last-in/first-out order. 29. A binary search works with any array of numbers. 30. For the binary search in the text to work, the element searched for must actually be present in the array