A hash table with the 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. a) What is the prime hash table size? w b) (The next key (i.e., the fourth key) that is hashed to the table after three collisions (each collision with a different key) is 326. 1. Where is 326 hashed in the table