(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.
0
35
0
0
0
1
1
1
2
2
2
2
3
3
3
3
How the hash table looks like after inserting the following keys sequentially?25, 96, 35, 105
4
105
4
105
4
4 105
5
25
5
25
5
25
5
25
6
96
6
96
6
96
6
96
Α. (2)
Β. (3)
C. (1)
D. (4)
7
7
7
35
7
35
8
8
8
105
8
9
9
35
9
9
(1)
(2)
(3)
(4)
Q: 39
