Consider the algorithm below shown as pseudo code:

$3$ pointsSelect all the correct facts from the list $$elow$.$ Ensure that no incorrect facts are selected.For each n$,$ in the best case, the algorithm exits after a constant number of steps. This is realized specifically by an array whose very first element is a prime number.For each n$,$ the algorithm executes in time that is linear in n in the worst case.The worst case is realized by an array of all composite numbers.The worst case complexity of this algorithm is $($upper bounded by$)$ O$($n$^(3)).$The worst case complexity of this algorithm is $($lower bounded$)$ Omega$($n$)$The worst case complexity of this algorithm is Theta$($n$^(2))2.$ Algorithm X programmed by an "ace programmer" runs in time $2\mathrm{.}5$n$^(4)+3$n$^(3)$