# Design and Analysis of Algorithm

For the input data 30, 20, 56, 75, 31, 19 and hash function h(K) = K mod 11:

a. Construct the open hash table.

b. Find the largest number of key comparisons in a successful search in this table.

c. Find the average number of key comparisons in a successful search in this table.

For the input data 30,20,56,75,31,19 and hash function h(K)=Kmod11 : a. Construct the open hash table. b. Find the largest number of key comparisons in a successful search in this table. c. Find the average number of key comparisons in a successful search in this table