(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.
0
0
36
0
0
36
1
1
1
36
1
2
2
2
2
3
3
3
3
4
4
106
4
4
How the hash table looks like after inserting the following keys sequentially?
5
5
5
ال
106
5
106
6
26
6
26
6
26
6
26
26, 97, 36, 106
7
97
7
97
7
97
7
97
8
26
8
8
8
Α. (4)
9
106
9
9
9
Β. (1)
(1)
(2)
(3)
(4)
C. (3)
D. (2)
Fish
6
