Assume a hash table T[0..15] (that is, m = 16), and a open addressing hashing whereh(x, i) = {x + i · (x mod 10)} mod m. Assume you start with an empty table. Show an example of a set of three distinct keys {k1, k2, k3} such that(a) You could not insert all of them into the table. That is, calling insert(k1), followedby insert (k2), followed by insert (k3) would report that the last operation is unsuccessful. And in addition,(b) kj mod 10 > 0 for j = 1, 2, 3.
How to solve this kind of question? When will the insertion be unsuccessful?