This question is concerned with hashing with open addressing…
This question is concerned with hashing with open addressing where the (linear) probing sequence is defined by h'(k) = k mod 10 and h(k, i) = (h'(k) + i) mod 10. Assume that the content of the hash table T is as follows: T(0) = 49 T(1) = 1 T(2) = NIL T(3) = NIL T(4) = DELETED T(5) = 25 T(6) = DELETED T(7) = 36 T(8) = 64 T(9) = 9 Note that I have used parentheses (rather than brackets) due to the Canvas Syntax. (a) The first cell (index to the table) probed by Hash-Search(T, 64) is (b) The last cell (index to the table) probed by Hash-Search(T, 64) is (c) The first cell (index to the table) probed by Hash-Insert(T, 29) is (d) The last cell (index to the table) probed by Hash-Insert(T, 29) is (e) The last cell (index to the table) probed by Hash-Delete(T, 96) is