PYTHON (DATA STRUCTURES AND ALGORITHMS)

Which of the following are true: (there are multiple correct answers, choose them all)

Tail recursion:

1. A tail recursion makes recursive calls as its last step.

2. There should be no statement after a recursive call.

3. The BinarySum function(a function that adds all the numbers in an integer array using Binary recursion) is not a tail recursion.

4. A tail recursion must be a linear recursion

5. A tail recursion doesn't have to be a linear recursion.

Binary Recursion:

1. A binary recursion has two recursive calls included in the implementation.

2. A binary recursion could have one or more base cases.

3. A binary recursion has two recursive calls been executed in non-base cases.

4. A binary recursion has exactly two base cases.