By using the Master Theorem which is a tool used to analyze the asymptotic behavior of divide-and-conquer algorithm; What is the complexity of an algorithm described by the recurrence T(n)=4T(n/3)+n2.