Thumb up for the solution, thx!

5) Hashing (10 marks) a) An empty hash table S has 7 slots with chaining, let the hash function be h(k) -kmod 7 Suppose we insert into S a set of numbers 5,28, 19, 15, 20, 33, 12, 17, 10, how many collisions will happen? If a value is mapped into a non-empty slot, there is a collision b) Let S be a hash table which uses open-addressing with load fact a (0a