The keys 44, 63, 29, 78, 23, 6, 81, 14, 13, 12 and 52 are inserted into an initially empty hash table of length 12 using linear probing with hash function h(k)= k mod 12. What is the probability that the 10th slot will be filled next?
i. 11/12
ii. 1/12
iii. 10/12
iv. 1
The answer given is i but according to me it should be iv because after we insert all the given numbers in the hash table only one slot is left which have a probability of filling as 1 because no matter what index we get for the next insert we are going to fill 10th slot only.