Q$2$ Tree Recursion $-$ Conceptual

$1$ Point

Tree recursive functions are those that Mark all that are True:

Always need at least two base cases.

Generally have a linear time complexity.

Can solve a problem by solving $(>1)$ smaller instances of the same problem.

Make more than one recursive call in $1$ or more recursive case$($s$).$

Have more than one recursive case.

Have more than one base case.

Now, mark the following statement if it's True:

The Fibonacci sequence and the computation of factorials are both typical examples of

problems that are solved using tree recursive procedures.

$*$Unsaved Changes