Solve the following runtime recurrences using the master theorem. = T(n) = 464T (A/2) + n/2 + 4 T(n) T(n) = 2T(n/4) + 2n0.5 +3 T(n) = = T(n) = AT(2) + n Tn) = T(n) = 4T(n/4) + 5n/3 + 5 T(n) = = T(n) = 8T(n/2) + n = T(n) = (n^3) el logn) Master Theorem does not apply O(nlogn) O(n^3 logn) (n^2) e(n)