$3$

$1$ point

What is the worst case performance of a hash table lookup?

$O(1)$

$O(lgn)$

$O(n)$

$O(nlgn)$

$O(n^2)$

None of the above.