[5 points = 4 + 1 points] Suppose we would like to insert a sequence of numbers into a hash table with table size 8 using the two open addressing methods: linear probing and double hashing. The primary hash function is h1(k) = k mod 8, and the secondary hash function is h2(k) = 1 + (k mod 7). Linear probing function would then be h(k, i) = (h1(k) + i) mod 8 Double hashing function would then be h(k, i) = (h1(k) + i h2(k)) mod 8 [4 points] If the sequence of keys is <39, 31, 23, 79, 48>, please successively insert these keys into the following table. Show each collision with an x in the table slot along with the key that is stored in the slot.