6. (5 points) (a) (2 points) Give the content of the hash table that results after inserting items with keys: 56 347 16 28 53 34 87 18 41 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) (3 points) Consider a hash table of size M using separate chaining with unordered lists and the hash function hash(k)= k mod M. 0 (1.5 points) 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: (1)(1.5 points) 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