Question 6: Collision Resolution of Hashing (15 points) To resolve the collisions in hashing, we learned two approaches:

[answerhappygod]

Question 6: Collision Resolution of Hashing (15
points) To resolve the collisions in hashing, we learned
two approaches: opening hashing, wherein all
records that hash to a particular slot are placed on that slot’s
linked list, and closed hashing, where recodes are
stored directly in the hash table. There are two closed hashing
mechanisms: bucket hashing, where hash table are
divided into buckets, and linear probing, wherein
if the home position is occupied, it checks the next slot in the
hash table. Assume that you have a 10-slot closed hash table (the
slots are numbered
0 through 9). Consider a list of numbers: 18, 36, 64, 13, 73, 25,
8. Show the final hash table that would result if you used the hash
function h(k) = k mod 10 and
b.Bucket hashing with 5 buckets, each
of size 2.
c. Linear probing