Answer the following statements true (T) or false (F)
1. Like a loop, a recursive function must have some method to control the number of times it repeats.
2. When a recursive function directly calls itself, this is known as direct recursion.
3. A problem can be solved with recursion if it can be broken down into successive smaller problems that are the same as the overall problem.
4. To solve a problem recursively, you must identify at least one case in which the problem can be solved without recursion.
1. T
2. T
3. T
4. T
Computer Science & Information Technology