A recursive algorithm splits a problem of size $n$ into three subproblems of size $n/4$ each, with a merge cost of $O(n^2)$. The recurrence is $T(n) = 3T(n/4) + cn^2$. What is the tight asymptotic bound?