5. (5 pts) Use the Master theorem to find bounds for each of the recurrence relations below If the Master theorem does not apply, say so and explain why. You need to justify your answers to get full credit for this question. If you are applying Case 1 or Case 3 of the Master theorem, you need to show that one of the functions grows polynomially faster than the other and specify the e for which it is true. If you are applying Case 3 of the Master theorem, make sure to check the regularity condition. (a) (1.5 pt) T(0)-T(1) = Cl T(n) = 8T(n/2)- n* + n*log n + 2log n