Problem
Consider a hash table with 0 to 9 slots where 0,1,5,9 these four slots are taken. Imagine we have a hash table with 10 slot where 4 of them are taken. Use linear probing to resolve collisions, what is the probability that we will have exactly 1 collision in the next 3 insertions?