# Upper bound for recurrence equation $T(n) = 4T\left(\frac{n}{2}\right) + n^2$

It’s been a while for me since my undergraduate class in algorithms. Could you please help me find an upper bound for this recurrence equation?

$$T(n) = \begin{cases} 14 &\quad\text{if } n<1\ 4T\left(\frac{n}{2}\right) + n^2 &\quad\text{if } n\gt1 \ \end{cases}$$