Assume a hash table where every possible key maps to a distinct location in the hash table $($i$.$e$.$ no collisions $).$ What is the worst$-$case time complexity of the search operation? $($assume $n$ is the size of the data set$)$

$(1)$

$O(n^2)$

None of these

$O(n)$

$O(log(n))$