Given the master theorem as below, characterize the performance of the following recurrence equations (assume that T(n)=c for n0 and d>=1)

c if n

T(n)={ aT(n/b)+ (n) if n d

1. if (n) is (n ^{log_{b a-}}), then T(n) is (n^log_ba)

2. if (n) is (n^log_ba log^k n), then T(n) is (n^log_ba log^k+1n)

3.if (n) is (n^{log_b a+}), then (n) is ((n)),

provided af (n/b) (n) for some

a. T(n)=27T(n/3)+n³ logn

b. T(n)=T(n/4)+log³ n

c. T(n)=3T(n/)+logn

d. T(n)=16T(n/2)+n⁴