1.) We have a hash table of size 7 to store integer keys, with quadratic probing and a hash function h(key) = key mod 7 (key mod 7 return the remainder of the integer division with 7). Show the content of the hashtable after inserting the keys 0,11,3,7,1,9 in the given order.

2.) We have a hash table of size 7 to store integer keys, with double hasing and hash functions are h1(key) = key mod 7 (key mod 7 return the remainder of the integer division with 7) and h2(key)=key mod 5. Show the content of the hashtable after inserting the keys 0,11,3,7,1,9 in the given order.