Assume a Hash table has 11 slots and an ordinary hash function h(k)-k mod 9 is used for first hash. The keys 5, 28, 19, 15, 20, 33, 12, 17, and 10 are inserted in the table with collision resolution using open addressing (a) Show the hash table obtained after inserting all 9 keys, if linear probing is used. She ta haeh tale aiad ater inedraping with - and c2 = 3 is used