I need the answer to be written in a clear hand writing .

------------------------------------------------------------------------------------------------------------------------------

(12 points) Insert the following keys, in order, into a hash table for each case below. 17, 23, 40, 12, 6, 28 1. The hash function: H(key)- key mod tableSize Case a. Open addressing with linear probing. Case b. Open addressing with quadratic probing. Case c. Open addressing with double hashing, where the hash function for probing is: P(key)-c-key mod c), where c = 7. Case d. Separate chaining. Case d: Case c. index valueindex valueindex value Case b. Case a. index value 0 1 0 1 0 0 4 4 4 7 5) 10 10 1 10