Consider an extendable hash structure where buckets can hold $3$ search key

values. The hash function given is h$($x$)=$ x mod $16.$ The hash value of a search key is a $4-$bit

binary value. The entries with the key values listed below are inserted in the following order:

$22,36,9,24,91,66,12,48,81,23,16,3$

Use the most significant bit of the hash value during insertion.

$($a$)[5$ pts$]$ Find the $4-$bit hash values in $4-$bit binary for the given key values