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

1) A recursive function is a function whose definition contains a call to the function
being defined
2) A design technique is to break a problem into smaller tasks, with the prospect that a smaller problem will be easier to solve. If the smaller task is the identical to the original task excepting only that the size is smaller, the problem may be solved using a recursive algorithm, and implemented with a recursive function.
3) It is proper for a recursion to run on without ending.
4) 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.

1) T
2) T
3) T
4) T