3. Assume a hash table with 7 locations and the hashing
function h(i) = i%7. Show the hash table that results when the
integers are inserted in the order given. (10 points each. Total
30)
• 5, 11, 18, 23, 28, 13, 25, with collisions resolved using
linear probing
• 5, 11, 18, 23, 28, 13, 25, with collisions resolved using
quadratic probing
• 5, 11, 18, 23, 28, 13, 25, with collisions resolved using
chaining.