Using the Master Theorem on T(n)=3T(⌊n/2⌋)+n2T(n) = 3T(\lfloor n/2 \rfloor) + n^2T(n)=3T(⌊n/2⌋)+n2, find the time complexity.
Θ(nlog23)\Theta(n^{\log_2 3})Θ(nlog23)
Θ(n2)\Theta(n^2)Θ(n2)
Θ(n2logn)\Theta(n^2 \log n)Θ(n2logn)
Θ(n3)\Theta(n^3)Θ(n3)