(Choose 1 answer)
Given the division hash
function h(x) = x%M.where M = 10 and Collision Resolution is quadratic probing. i.e.when inserting a key x.the collision is resolved by finding an available position at (h(x) + i^2)%M). i=1, 2.How the hash table looks like after inserting the following keys sequentially?34, 65, 94, 204
0
0
0
0
1
1
1
1
2
2
204
2
2
3 204
3
3
204
3
4
34
4
34
4
34
4
34
5
65
5
65
5
65
5
65
6
6
6
6
7
7
7
7
8
8
94
8
94
8
94
9
94
9
9
9
204
A. (4)
(1)
(2)
(3)
(4)
B. (2)
C. (1)
D. (3)
