What is the big$-$O worst$-$case time cost of accessing an arbitrary element in an array? Select the tightest bound that holds.

Group of answer choices

O$($n$2)$

O$(1)$

O$($log n$)$

O$($n$)$