(Choose 1 answer)
0
0
0
0
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,
1
1
1
1
2
2
2
2
How the hash table looks like after inserting the following keys sequentially?64, 75, 95, 204
3
3
3
3
4
64
4
64
4
64
4
64
A. (4)
5
75
5
75
5
75
5
75
Β. (1)
6
95
6
95
6
6
C. (2)
7 204
7
7
95
7
95
D. (3)
8
8
204
8
204
8
9
9
9
9
204
(1)
(2)
(3)
(4)
3
