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?

**** i just need the answer for number 2 as i have already answered the 1st question

**** Also this is a question in Java programming language

Thank you