Q2. [10] Consider the following recursion time function:

T(n) = 4T(n/10) + f(n)

f(n) = n

1. [1] Write your own recurrence time function.

2. [3] Draw a recursion tree for your recurrence time function.

3. [2] How many levels would there be in the tree, as a function of n?

4. [2] How many leaves would be in this tree, as a function of n?

5. [2] Solve the recurrence to obtain an asymptotic complexity expression for T(n) as a function of n.