Please help asap. Thank you (Analysis of algorithm)

Find the time complexity T(n) using Master Theorem. (1) T(n)=9T(3n)+n (2) T(n)=3T(32n)+1 (3) T(n)=3T(4n)+nlogn (4) T(n)=3T(2n)+n2 Theorem: Let a1 and b>1 be constants, let f(n) be a function, and let T(n) be defined on the nonnegative integers by the recurrence T(n)=aT(n/b)+f(n), where n/b can mean n/b or n/b. If f(n)O(nlogba) for some constant >0, then T(n)(nlogba) If f(n)(nlogba), then T(n)(nlogbalgn) If f(n)(nlogba+) for some constant >0, and if af(n/b)cf(n) for some constant c