Under certain assumptions, the expected cost of an insertion in a hash table with secondary clustering is given by 1/(1 – λ) – λ – ln(1 – λ). Unfortunately, this formula is not accurate for quadratic...

Under certain assumptions, the expected cost of an insertion in a hash table with secondary clustering is given by 1/(1 – λ) – λ – ln(1 – λ). Unfortunately, this formula is not accurate for quadratic probing. However, assuming that it is,

 a. What is the expected cost of an unsuccessful search?

 b. What is the expected cost of a successful search?