In simple uniform hashing, what is the search complexity?

(a) O(n)

(b) O(logn)

(c) O(nlogn)

(d) O(1)

My question is from Hash Tables in division Hash Tables of Data Structures & Algorithms I

I have been asked this question in an international level competition.