![4. (10 points) Consider an open address hash table TI0,... , (m - 1)] with linear probing Assume simple uniform hashing and t](https://media.cheggcdn.com/media%2F1e2%2F1e211f20-842e-4d19-a91e-96014216a4e5%2FphphBJJDt.png)
4. (10 points) Consider an open address hash table TI0,… , (m – 1)] with linear probing Assume simple uniform hashing and that there are no deletions. Suppose that the slots T’m/2,… , (m-1)] are occupied, and the remaining slots are empty. Also assume m is a multiple of 2 so that m/2 is an integer. (a) (5 points) Find the probability that the slot T’o) will be filled in the next insertion. Explain.
OR
OR