Suppose an algorithm runs in time

$200$

log

$2$

$($

$$

$)$

$+$

$250$

$200$log

$2$

$$

$($n$)+250$ time in the worst case as a function of the input size

$$

n$,$ which of the options below are correct?