Problem 5 (32 points) Use the master method to give tight asymptotic bounds for the following recurrences. a) T(n)=T(2n/3)+1 b) T(n)=2T(n/2)+n4 c) T(n)=T(7n/10)+n d) T(n)=5T(n/2)+n2 e) T(n)=7T(n/2)+n2 f) T(n)=2T(n/4)+n g) T(n)=T(n2)+n2 h) T(n)=27T(n/3)+n3lgn