In the hash table below we use open addressing with linear probing to resolve collisions.
The hash function is h(x)=x(mod11). In the table x denotes the places of deleted elements.
0 1 2 3 4 5 6 7 8 9 10
11 34 24 x x 6 x x
When inserting number 12 what is distance between its hash value and its final position?
Select one or more:
A- 10
B- 1
C- 4
D- 3
E- 9