Once you attempt the question then PrepInsta explanation will be displayed.

The hashing and probing. Let us put values 1, 3, 8, 10 in the hash table of size 7. Initially, hash table is empty

- - - - - - -

0 1 2 3 4 5 6

The value of function (5x + 2)mod 7 for 1 is 0, so let us put the value at 0

1 - - - - - -

0 1 2 3 4 5 6

The value of function (5x + 2)mod 7 for 3 is 3, so let us put the value at 3

1 - - 3 - - -

0 1 2 3 4 5 6

The value of function (5x + 2)mod 7 for 8 is 0, but 0 is already occupied, let us put the value(8) at next available space(1)

1 8 - 3 - - -

0 1 2 3 4 5 6

The value of function (5x + 2)mod 7 for 10 is 3, but 3 is already occupied, let us put the value(10) at next available space(2)

1 8 10 3 - - -

0 1 2 3 4 5 6