$\star$ Consider an open-address hash table with a load factor $\alpha$. Find the nonzero value $\alhpa$ for which the expected number of probes in an unsuccessful search equals twice the expected number of probes in a successful search. Use the upper bounds given by Theorems 11.6 and 11.8 for there expected number of probes.