c. Double Hashing: Create a hash table with 10 slots (m 10), using the hash function h (K)- K mod m, and insert the following elements into the hash table: 89, 18, 49, and 69 inserted in that order. Use double hashing to resolve collisions. Let the primary hash function be H1(key) key mod 10, and the secondary hash function be H2(key) 7 - (key mod 7)