Assume an open addressing hash table implementation, where the size of the array is N-19, and that double hashing is performed for collision handling. The second hash function is defined as: d(k) = q _ k mod q. where k is the key being inserted in the table and the prime number q is-7. Use simple modular operation (k mod N) for the first hash function