A recursive algorithm makes 3 disjoint recursive calls on subproblems of sizes $n/4$, $n/4$, and $n/2$, and takes $\Theta(n^2)$ time to combine results. The recurrence is $T(n) = 2T(n/4) + T(n/2) + n^2$. Using the Akra–Bazzi method, what is $\Theta(T(n))$? (Hint: Find $p$ such that $2(1/4)^p + (1/2)^p = 1$.)