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

Under certain assumptions, the expected cost of an insertion into 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, determine the following:
a. The expected cost of an unsuccessful search.
b. The expected cost of a successful search.