hash table has a hash function h(k)=k mod m uses the double hashing strategy to resolve collisions. The first three keys 193, 297 and 321 produce the hash values 3, 12 and 17, respectively. 1-) What is the prime hash table size 2-)The next key (for example the 4th key) that is hashed to the table after 3 collisions (each collision with a different key) is 326. 2a).Where is 326 hashed in the table