(3 pts) Solve the following recurrence relations using the master method. I tell you what case to use for each recursion. You do not have to check the regularity conditions for Case 3. Show your work by giving a, b, f(n) and T(n) below. o (Case 1): T(n) = 9T(n/3) + n a = 9 b = 3 = n^2 f(n) = n T(n) = (n^2) o

(Case 2): T(n) = 4T(n/2) + n2 a = 4 b = 2 = n^2 f(n) = (n^2) T(n) = (n^2 lg n) o

(Case 3): T(n) = T(n/2) + n a = 1 b = 2 = n^log 2 f(n) = (n2+) T(n) = (n3)