Given: -The hash function: h(x)=(3x+2) 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). (I need help on all of number 4a 4b 4c)

The hash function: h(x) = 13x + 21 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