Algorithm Problem: Hashing

Please include all the steps and details for learning purposes.

Given the keys 16, 11, 5, 37, 15, 33, 27, 4, 13 and a hash table of size 11. (1) Insert the above keys using chaining with hash function h(k) = k mod 11; (2) (Linear probing) Insert the above keys using open addressing with hash function h(k,i) = (h' (k) + i) mod 11, where the auxiliary hash function is h' (k) = k