In simple uniform hashing, what is the search complexity?

Pick ONE option

O$($n$)$

O$($logn$)$

O$($nlogn$)$

$0(1)$