GATE DA 2024 Q21: Expected probes to insert into an open-address hash table

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

Inserting an element in this hash table requires at most ______ probes, on average.