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