Q26,paper 2,J13. Given an open address hash table with load factor α < 1, the expected number of probes in a successful search is

(A) Atmost (1/α)ln(1-α)/ α

 (B) Atmost (1/α)ln(1/(1-α))

(C) Atleast (1/α)ln(1/(1-α))

 (D) Atleast ((1/α)ln(α /( α -1))

Answer  B.