Strassen's algorithm for matrix multiplication uses a divide-and-conquer approach that satisfies: $T(n) = 7T(n/2) + \Theta(n^2)$ where the 7 comes from 7 recursive matrix multiplications of half-size. What is $\Theta(T(n))$? (Note: $\log_2 7 \approx 2.807$)