A Hash function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0, in which location the key 11 will be stored (count table Index 0 as 0th location)?

A Hash function f is defined as f(key) = key mod 7. With linear probin

1.	A Hash function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0, in which location the key 11 will be stored (count table Index 0 as 0th location)?
A.	3
B.	4
C.	5
D.	6
Answer» D. 6