Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is the probability that we will need three probes, when inserting the third key, k3?
- 3/m
- 2/m2
- 3/m2
- 2/m
Please explain the solution.