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, indicate that the Master Theorem does not apply. Remember to show every step clearly. 1. T(n)=3T(n/2)+n2