(Choose 1 answer)
0
0
0
0
Given the division hash function h(x) = x%M, where M = 10 and Collision Resolution
1
21
1
21
1
21
1
21
2
2
2
2
3
203
3
203
3
203
3
203
is linear probing. How the hash table looks like after inserting the following keys
4
64
4
64
4
64
4
64
5
95
5
95
5
95
5
95
sequentially?95,64,21, 203, 44,144
6
44
6
144
6
6
7
144
7
44
7
7
8
8
8
44
8
144
A. (2)
9
9
9
144
9
44
B. (3)
(1)
(2)
(3)
(4)
C. (1)
D. (4)
vato
fini
10
