1. (15 points) Problem 1: Hash Tables. (a) (5 points) Draw the 11-entry hash table that results from using the hash function h(i)=(3i+5)mod11, to hash the keys 12,44,13,88,23,94,11,39,20,16,5, assuming collisions are handled by chaining. (b) (5 points) Repeat part (a) but now resolve collisions using linear probing. (c) (5 points) Repeat part (a) but now resolve collisions using double hashing where the secondary hash function is defined as h(k)=7(kmod7)