(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
0
0
0
203
1
1
1
1
2
2
2
2
3
63
3
63
3
63
3
63
2.How the hash table looks like after inserting the following keys sequentially?63, 74, 94, 203
4
74
4
74
4
74
4
74
5
94
5
5
94
5
6
6
94
6
203
6
7 203
7 203
7
7
94
8
8
8
8
A. (2)
9
9
9
9
B. (3)
(1)
(2)
(3)
(4)
C. (4)
D. (1)
El (11
