Given an open address hash table with load factor $\alpha <1$, the expected number of probes in a successful search is
- Atmost $\frac{1}{\alpha}$ In $( \frac{1-\alpha}{\alpha})$
- Atmost $\frac{1}{\alpha}$ In $( \frac{1 }{1-\alpha})$
- Atleast $\frac{1}{\alpha}$ In $( \frac{1 }{1-\alpha})$
- Atleast $\frac{1}{\alpha}$ In $( \frac{\alpha }{1-\alpha})$