Hashing

2. Suppose that a hash table contains HASHSIZE-13 entries indexed from 0 through 12 and that the following keys are to be mapped into the table of length 13. 10, 100, 32, 45, 58, 126, 3, 29, 200, 400, 0 Then, for the above key sequence show the contents of the hash table after each insertion, assuming the hash function h (k) -k % 13 for each of the models below. (c) chaining (d) linear probing (e) quadratic probing