1. Master theorem (5 points) Use the master theorem to find tight asymptotic bounds for the following recurrences. If the master theorem cannot be applied, state the reason and give an upper bound (big-Oh) which is as tight as you can justify. Justify your answers (by showing which case of the master theorem applies, and why.) (1) T(n) = 9Tn/3) + Vn (2) Tn) = 2T (n/2) + n log n (3) T(n) = 36T(/6) +n? (4) T(n) = T(2n/5) +n (5) T(n) = T(2n/3) +T(n/3) +n