You have to draw the steps in a clear and organized way, DO NOT post a program!

Q1. Draw the 11-entry hash table that results from using the hash function h(k) (3k - 5) mod 11 to hash the keys 31, 45, 14, 89, 24, 95, 12, 38, 27, 16, and 25, assuming that collisions are handled in the following ways:i linear probing double hashing using the secondary hash function h'(k) 5 - (k mod 5). a) b)