(a) Give the content of the hash table that results after inserting items with keys: 28 53 34 8718 41 47 16 56 3 in this order into an initially empty hash table of size M=10 using linear probing. Use the hash function hash(k)= k mod M. Answer: 0 1 2 3 4 5 6 7 8 9 (b) Consider a hash table of size Musing separate chaining with ordered lists and the hash function hashck) = k mod M. (i) Assume N items have already been inserted in the table. What is in average, the cost (number of operations) needed for searching an item in the table? Justify your answer. Answer: () Assume N items have already been inserted in the table. What is in average, the cost (number of operations) needed for inserting the next (N+1). item? Justify your