Using θ-notation, provide asymptotically tight bounds in terms of n for the solution to each of the following recurrences. assume each recurrence has a non-trivial base case of t(n) = θ(1) for all n ≤ n0 where n0 is a suitably large constant. for example, if asked to solve t(n) = 2t(n/2) + n, then your answer should be θ(n log n). you do not need to explain your answers. (a) t(n) = 9t(n/3) + n 2 (b) t(n) = t(n/2) + p n (c) t(n) = 5t(n/2) + n 2 (d) t(n) = t(n/4) + t(3n/4) + n (e) t(n) = t(n/6) + t(2n/3) + n