Analysis of Algorithms

Consider the following growth functions: $f_1(n)=10log(n)+(\frac{1}{2})n^2-5510$ What is the Big$-$Oh order of this function? You should provide a relatively tight upper bound $($e$.$g$.,$ not just $2^n).$

O$($logn$)$

$O(n)$

$O(n^{{?}^{{?}^{?}}}3)$

$O(n^{{?}^{{?}^{?}}}4)$

$O(1)$

$0(n^{{?}^{{?}^{?}}}2)$