Express the asymptotic time complexity for each algorithm in terms of "big$-$Q$"$ notation.

$T(n)=\frac{n^3}{1000}-100n^2-100n+3$

$O$

$T(n)=2^{10}+n^{4}log(n^3)-100n^4+2^n$

$O$

$T(n)=0\mathrm{.}003logn+log(logn)$

$O$

$T(n)=3^n+nlogn+2n^{3000}$

OC