For each of the following recurrences, give an expression for the runtime T(n) if the recurrence can be solved with the Master Theorem. Otherwise, explain why the Master Theorem does not apply. Justify your answer.

1. T (n) = 3T (n/2) + n 2
2. T (n) = 4T (n/2) + n 2
3. T (n) = T (n/2) + 2n
4. T (n) = 2nT (n/2) + nn
5. T (n) = 16T (n/4) + n
6. T (n) = 2T (n/2) + n log n
7. T (n) = 3T (n/3) + √ n
8. T (n) = 2T (n/4) + n 0.51
9. T (n) = 0.5T (n/2) + 1/n
10. T (n) = 3T (n/2) + n