1. (a) Given a prime number m = 13, and a set of 11 numbers={68,121,133,159,285,312,393,493,335,387,653}, use the Division Remainder method for the original hash function to build a hash table and use linear probing to resolve collision for the above set of numbers. (No program needed, just a hash table with number and by using diagram.

(b) DO the same for Part(a). But use open chaining to resolve collision for the same set of numbers.