Consider inserting the keys 12, 26, 37, 4, 17, 32, 19, 104, 69 into a hash table of length m = 13 using open addressing with the primary hash function h1(k) = k mod m. Illustrate the result of inserting these keys using linear probing, using quadratic probing with c1 = 1 and c2 = 3, and using double hashing with h2(k) = 1 + (k mod (m ¡ 1)).