(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 How the hash table looks like after inserting the following keys sequentially?
(h(x) + i^2)%M). i=1, 2.....
27, 98, 37, 107
A. (2)
Β. (1)
C. (4)
D. (3)
0
0
107
0
37
0
37
1
37
1
1
1
2
2
2
2
3
3
3
3
4
4
4
4
107
5
5
5
5
6
107
6
6
107
6
7
27
7
27
7
27
7
27
8
98
8 98
8
98
8
98
9
9
37
9
9
(1)
(2)
(3)
(4)
Exit 37
