Problem 1 Use the master method to give tight asymptotic bounds for the following recurrences. a) T(n) = T(2n/3) +1 b) T(n) = 2T("/2) +n4 c) T(n) = T(71/10) +n d) T(n) = 57(n/2) + n2 e) T(n) = 7T(1/2) + 12 f) T(n) = 27(1/4) + Vn g) T(n) = T(n 2) +n h) T(n) = 27T(n/3) + n lgn