1. Draw the 11-entry hash table that results from using the has function h(i) = (3i + 5) mod 11, to hash the keys 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, and 5, assuming collisions are handled by chaining.

2. What is the result of question (1), assuming collisions are handled by linear probing?

3. What is the result of question (1) when collisions are handled by double hashing using the secondary hash function d(k) = 7 (k mod 7)? (Note that 7 is a prime number).

4. Show the result of rehashing hash table shown in question (1) into a table of size 19 using the new hash function h(k) = 3k mod 17.

Please who can help with this question in Java

Thank you