Consider performing uniform hashing on an open address hash table with load…

Consider performing uniform hashing on an open address hash table with load factor $\alpha = \frac{n}{m} < 1$, where 𝑛 elements are stored in the table with 𝑚 slots. The expected number of probes in an unsuccessful search is at most $\frac{1}{1 - \alpha}$ . Inserting an element in this hash table requires at most ______ probes, on average.