1) (a) [5%] Consider inserting keys 15, 24, 30, 59, 46, 75, 44,17 into a hash table of
size m = 13 using open addressing with the primary hash functionh’(k) = k mod
m. Show the result of inserting these keys using (i) linearprobing; (ii) quadratic
probing: h(k, i) = (h’(k) + ½(i + i^2)) mod m; and (iii) doublehashing: h(k, i) =
(h’(k) + ih2(k)) mod m, where h2(k) = (k mod 11) +
OR
OR