HashSet look-up complexity?

Question

A look-up operation OR contains for single can be O(n) in worst-case right ? So, for n elements look up in hashSet will b

Answer 1

lookp takes O(c)

c = constant value