Answer the following questions true (T) or false (F)

1. A recursive function can have only one recursive case.

2. Each recursion causes a new activation frame to be placed on the stack.

1. False
Explanation: There is no reason to prohibit multiple recursive cases, nor, for that matter, multiple stopping cases.
2. True
Explanation: The activation frame contains the local variables and parameters created at each invocation of the function.