Example

$$ For the input $30,20,56,75,31,19$ and hash

function h$($K$)=$ K mod $11$

a$.$ construct the open hash table with linear

probing. Assume that the hash table size is $11.$

b$.$ Find the load factor after inserting all elements.

c$.$ find the largest number of key comparisons in a

successful search in the table.

d$.$ find the average number of key comparisons in a

successful search in this table.