Characterize each of the following recurrence equations using the master theorem (assuming that T(n) = c for n < d, for constants c > 0 and d 1). Show all work and give the big-Theta notation of the complexity of each. For each part, make sure to give the Master Theorem Case that applies and the value(s) of , , and/or k (as applicable).

T(n) = 16T(n/2) + (nlog(n))⁴