The efficiency of the HashTable to lookup in an empty or nearly empty table is big-O of:
a) O(1)
b) O(log n)
c) O(n)
d) O(n^2)