A recursive function T(n)=3T(n/2)+n2T(n) = 3T(n/2) + n^2T(n)=3T(n/2)+n2. Using the Master Theorem, what is the complexity?
O(n2logn)O(n^2 \log n)O(n2logn)
O(n2)O(n^2)O(n2)
O(nlog23)O(n^{\log_2 3})O(nlog23)
O(n3)O(n^3)O(n3)