Consider the algonthm below shown as pseudo code:Select all the correct facts from the list below. 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))$