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

a) A method that calls itself indirectly is not an example of recursion.
b) Recursion can be efficient in computation because of reduced memory-space usage.
c) When a recursive method is called to solve a problem, it actually is capable of solving
only the simplest case(s), or base case(s).
d) To make recursion feasible, the recursion step in a recursive solution must resemble the
original problem, but be a slightly larger version of it.

1) False. A method that calls itself in this manner is an example of indirect recursion.
2) False. Recursion can be inefficient in computation because of multiple method calls and excessive memory-space usage.
3) True.
4) False. To make recursion feasible, the recursion step in a recursive solution must resemble the original problem, but be a slightly smaller version of it.