Please use the Master Theorem to solve (d).

The Master Theorem states: If a recurrence satisfies the form: T(n) = aT(n/b) + f(n) a is a constant such that a > 1 b is a constant such that b > 1 f(n) is a function Case 1: If f(n) = O(nlogo a-C) for some constant e > 0, then T(n) O(nlogoa) Case 2: If f(n) = O(nlogoa), then T(n) = O(nlogo a lg n) Case 3: If f(n) = N(nlogo a+c) for some constant e > 0, and if af(n/b)