The hash function: h(x) = |3x + 1| mod M a bucket array of capacity N a set of objects with keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 (to input from left to right) Write the hash table where M = N = 11 and collisions are handled using separate chaining. Write the hash table where M=N=11 and collisions are handled using linear probing. Would a size N for the bucket array exist, such that no collisions would happen with the hash function hash function h(x) = |2x + 5| mod 11 and the keys above