What's the big oh for unsuccessful linear search of a sorted array?

Group of answer choices

O$($n$)$

O$($n$-$squared$)$

O$(1)$

O$($log n$)$