Given a hashing algorithm that uses chaining to address collisions. We want to find $($or search$)$ to retrieve the value if given the key. If the collision rate is very low, the Big O runtime complexity is $\_\_\_\_\_\_\_\_.$ However, if the collision rate is very high, the Big O runtime complexity approaches $\_\_\_\_\_\_\_\_.$ This is the reason why collision rate is an important consideration.

a$.$

O $($ N $),$ O $($ N $$ l o g N $)$

b$.$

O $(1),$ O $($ l o g N $)$

c$.$

O $($ N $$ l o g N $),$ O $($ N$2)$

d$.$

O $(1),$ O $($ N $)$