Please Answer Both Part A and B

(20 pts) Hashing and Hash Tables. (a). Consider a hash table of size 29, In the context of chain hashing, is h(k) (1%11)%29 a good hash function? Justify your answer. 5 pts) b) Let m and n are two integers. You have to store a set (consisting integers) of size Option 1: Store S in an hash table of size mn and use the hash function Option 2: Store in a 2-Dimensional Array A and use two hash functions mi. Consider the following two options: h(x) = x%mn. Alh(a)h2(a) disprove this claim. h, and h2, where hi(z) = x%m and h2(z) = 7%n. Now we store z in It is claimed that collision reduces significantly with the second option. Prove or (15 pts)