1 Draw the recursive call tree for the printRev() function from Section 10.1 when called with a value of 5. 2 Determine the worst case run time of the recursive factorial function. 3 Determine the...

1 Draw the recursive call tree for the printRev() function from Section 10.1 when called with a value of 5.

2 Determine the worst case run time of the recursive factorial function.

3 Determine the worst case run time of the recursive Fibonacci function.

4 Show or prove that the printList() function requires linear time.

5 Does the recursive implementation of the binary search algorithm from Listing 10.6 exhibit tail recursion? If not, why not?