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.

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.

**** I just need the answer to question number 4

*** Thank you