What is the big O for an algorithm whose running time is given by the equation:
T(n) = 300,000 log n + 200n2 + 1000n + 2n
