3. Solve the recurrences below using the master theorem if possible, showing your work. One of these is not solvable by the basic master theorem (as stated on page 94 of the textbook) for that one, explain why we can't use the master theorem. a. T(n) = 4T(n/2) + n b. T(n) = 3T(n/3) + nlgn c. T(n) = 4T(n/2) + n2 d. T(n) = 9T(n/3) + n lgn