PROBLEM 4 (24 points) Master method uses the following theorem. Theorem 4.1 (Master theorem) Let a 21 and b > 1 be constants, let f(n) be a function, and let T (n) be defined on the nonne gative integers by the recurrence T(n) aT (n/b) f(n) where we interpret n/b to mean either ln or rn/b]. Then T(n) has the follow- ing asymptotic bounds: 1 . If f(n) = 0("kg,a-4) for some constant > 0,thenTin-en"re"). 3. If f(n)-(nkna+*) for some constant e > 0, and if af(n/b) cf(n) for some constant c