can you do both questions Thanks

8. For the following recurrences, find a good asymptotic upper bound using recursion tree method (6) a. T(n) = 4T(n/2) +n b. T(n) = 2T(n/2) + n lg n 9: For the following recurrences, find a good asymptotic upper bound using Master method (if applies) and substitution method (8) a. T(n) = 4T(n/2) + m2 b. T(n) = 4T(n/3) + nlgn C. T(n) = 2T(1/2) + T lg T. d. T(n) = 2T(n/4) + Vn