Suppose an algorithm runs in time $200lo{g}_2(n)+250$ time in the worst case as a function of the input size $n,$ which of the options below are correct?

$2$ points

The running time is $(lo{g}_{10}(n))$ since $lo{g}_{10}(n)=\frac{lo{g}_2(n)}{lo{g}_2(10)}$ is a constant factor times $lo{g}_2(n).$

It is impossible for an algorithm to have a running time that is smaller than the input size.

The running time of the algorithm is $O(n)$