Use the Master Method to solve the following recurrences. Be sure to chek for regularity conditions where appropriate. However: If you find that a recurrence seems to meet the conditions of case 3 but doesn't meet the regularity condition (af(n/b) lessthanorequalto cf(n) for some c n_0), then just say so. You don't need to solve the recurrence in this case, but you can do so for 3 points extra credit if you show your work). If f(n) is larger or smaller than n^(log_b a) but not polynomially so, then just say so. You don't need to solve the recurrence in this case, but you can do so for 3 points extra credit if you show your work). a. T(n) = 3T(n/4) + n b. T(n) = 2T (n/2) + n lg n c. T(n) = 5T(n/2) + n^2