In Python 3 What is the worst-case runtime of searching for a single value in a hashtable/dictionary?
a) O(N*log N)
b) O(1)
c) O(N)
d) O(log N)