Solve the following recurrences using the Master Theorem. You must state which case applies. If the theorem is not applicable, just say N/A.

7. [10 points) Solve the following recurrences using the Master Theorem. You must state which case applies. If the theorem is not applicable, just say N/A. Theorem 4.1 (Master theorem) Let a > I and b> I be constants, let f(n) be a function, and let (n) be defined on the nonnegative integers by the recurrence T(n) - aT (m/b) + f(n). where we interpret n/b to mean either [n/b] or [n/b]. Then (n) has the follow- ing asymptotic bounds: 1. If f(n) = (1-4) for some constant > 0, then 7(n) = (nles). 2. If f(n) = (1,4), then (n) = (yg n). 3. If f() = 2(0.4++) for some constant e > 0, and if af (nb) s cf(n) for some constant c