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. T(n) = 16T(n/4)+n! T(n) = 2T(3/2) + c/ logn