1. Consider the double hashing h(k, i) = (h₁(k) + ih₂(k)) mod m. Write efficient pseudocode for Insert(T, k).
2. Let the array size m = 2³ = 8.
   1. Compute the linear probe sequence h(k, i) = (h'(k) + i) mod m, i = 0, 1, m1. Presume h'(k) = 4.
   2. Compute the quadratic probe sequence h(k, i) = (h'(k) + i(i+1)/2) mod m. Presume h'(k) = 4.
   3. Compute the double-hashing probe sequence h(k, i) = (h₁(k) + ih₂(k)) mod m, for each of k₁ and k₂, presuming h₁(k₁) = h₁(k₂) = 4, h₂(k₁) = 5, h₂(k₂) = 7.
3. Consider hash tables with chaining. Determine the maximum value of n to ensure = n/m 1.5 for each value of m = 100, 200, 400, 800, 1600.