2. (20 pts) Solve the following recurrences. Assume in each case that T(c1, for an appropriate constant c. Provide sufficient details to show how you got the answer. (For example, show how you applied the Master method, or details of any other method you used.) (a) T(n) = 3T(n/2) + n2 (b) T(n) 4T(n/2) +n2 (c) T(n) = 5T(n/2) + r 2 (d) Solve the following recurrence both using the Master Method and the basic recur rence expansion method T(n) VnTm)+ Why do you think you get different answers? Which answer is the correct one