Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table of length m = 11 using open addressing with the auxiliary hash function h′(k) = k. Illustrate the result of inserting these keys using linear probing, using quadratic probing with c₁ = 1 and c₂ = 3, and using double hashing with h₁(k) = k and h₂(k) = 1 + (k mod (m – 1)).