Question: Show the result of rehashing the probing tables in Exercise. Rehash to a prime table size.
Exercise: Given the input {4371, 1323, 6173, 4199, 4344, 9679, 1989}, a fixed table size of 10, and a hash function H(X) = X mod 10, show the resulting
a. Linear probing hash table
b. Quadratic probing hash table
c. Separate chaining hash table