is quadratic probing, i.e. when inserting a key x, the Given the division hash function h(x) = x%M, where M = 10 and Collision Resolution collision is resolved by finding an available position at
(Choose 1 answer)
(h(x) + i^2)%M), i=1, 2,How the hash table looks like after inserting the following keys sequentially?27, 98, 37, 107
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
A. (2)
6
107
6
6
107
6
7
27
7 27
7
27
7
27
B. (3)
8
98
8
98
8
98
8
98
C. (1)
9
9
37
9
9
D. (4)
(1)
(2)
(3)
(4)
antonis ni
Ext 39
