Use linear probing, a hash table with b = 17 buckets, and the hash function f(k) = k mod b. Start with an empty hash table and insert elements with the keys: 7, 42, 25, 73, 14, 38, 8, 22, 34, 11. Insert the elements in this order.

(a) Draw the hash table following each insert.

(b) What is the loading factor of your table after the last insert?

(c) What is the maximum and the average number of buckets examined in an unsuc- cessful search of your table?

(d) What is the maximum and the average number of buckets examined in a successful search of your table?