[2%] Consider an algorithm with a running time function $T(n) = 50n^2 + 200n\log n + 10^6$. Is it mathematically correct to claim that $T(n) = O(n^2)$?