A recursive function $T(n) = 3T(n/2) + n^2$ describes the complexity of an algorithm. What is the Big-O complexity of $T(n)$ according to the Master Theorem?