(a) [7 points] Use the recurrence tree method to solve the time complexity of recurrence T(n) = 3T(n/4]) + θ(n2) in theθ-notation.