Consider the following keys that are hashed into the hash table in the order given using the hash function
$H(i) = (3i + 5) \ mod \ 11 $
12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5
Where to handle the collision chaining is used, after inserting all the above keys in table if 2 new keys inserted into table the what is the probability new items hashed into empty slot, (upto 2 decimal places)