5 10 Points Consider Two Open Address Hash Tables Ti O M 1 Linear Probing T20 M 1 Linear Q37105851

5. (10 points) Consider two open address hash tables TI[o,…, (m – 1)] with linear probing and T20,., (m – 1)] with linear probing, where m – 100. Assume simple uniform hashing and that there are no deletions. Suppose that in Ti every odd index is occupied and remaining slots are empty. While in table T2, T2[0,…,49] is occupied, and the remaining slots are empty. (a) (5 points) Find the probability that the

OR

 

OR