(Choose 1 answer)
Given the division hash = 10 and Collision Resolution function h(x) = x%M, where M is linear probing. How the hash table looks like after inserting the following keys sequentially?25, 21, 14, 32, 41, 191
A (2)
B. (1)
C. (4)
D. (3)
0
0
0
0
1
21
1
21
1
21
1
21
2
32
2
32
2
32
2
32
3 191
3
41
3
3
4
14
4
14
4
14
4
14
5
25
5
25
5
25
5
25
6
41
6
191
6
6
7
7
7
7
8
8
8
8
191
9
9
9
9
41
(1)
(2)
(3)
(4)
E1
