HASHING

1. 120 points] Hashing Consider a hashing scheme in which the hash table is size 13 with hash function x % 13, In- sert the following items, showing the final hash table for each hash method listed below after inserting the following: 31, 7, 48, 40, 69, 35, 44, 27, 85, and 61. For each, note any elements a. [5 points] separate chaining b. [5 points] linear probing c. [5 points] quadratic probing d. [5 points] double hashing with secondary hash function: h(x)-7-(x %