2. [Hashing, 25 points]

Insert the following keys into an initially empty hash table of size 10: 4371, 1323, 6173, 4199, 4344, 9679, 1989. Show the resulting hash table, with the hash function h(x) = x mod 10.

a. Using open hashing (i.e. chaining).

b. Using closed hashing (open addressing) with linear probing.

c. Using closed hashing (open addressing) with quadratic probing, C0=C1=0, C2=1.