Hash table takes O(1) time in average case, ie, with a not too bad hash function, and a sufficiently large size.
Direct Address Table, however, always gives O(1) time complexity. (it's not used because it's storage requirements are impractical)
Option C