3. [2 pts each, total 6 pts] Give tight asymptotic bounds ( bound) for each of the following recurrences. If you used the master method, clearly specify a,b,f(n) or value and which case you applied; if not, justify your answer. A) T(n)=9T(3n)+n2 B) T(n)=3T(5n)+n C) T(n)=5T(5n)+nlgn