The following recurrences are solvable using the Master Method of CLRS, Sec. 4.5. For each recurrence, determine the correct values of a, b, and f(n), then choose which case of the Master Method applies, apply the formula and then select the appropriate asymptotic complexity. You may assume, without checking, that the regularity condition for Case 3 is met. 1. O(1) [constant] 2. (lg n) T(n) = T(n/2) + n2 3. On) T(n) = 8T(n/2) + n2 4. O(n lg n) 5. O(n2) T(n) = 16T(n/4) + n2 6. nh) 7. n lg n)