What is the worst-case time complexity of search in a hash table with chaining?

Question

Accepted Answer

(C) O(n). Explanation: If all keys hash to the same bucket, the chain becomes a linked list of length n — O(n) worst case.