4-2- Show the result of inserting 5, 28, 19, 15, 20, 33, 12, 17, 10 into a hashtable with collision resolution by chaining. The table should have 9 slots and use h(k)-k mod 9 for the hash function. Now, show the result of inserting the first 6 of these into another hashtable using open entries you had to search before finding an open slot? g and linear probing. For these inserted entries, what was the largest number of 4-3- Consider the family of hash functions hb(x) 5x+b (mod 11) where b e [0,10] and the argument x to the hash function is from the universe {0,1,2,..21). Is this family universal? Explain