A hash function is defined as f(key) = key mod 7. Linear probing is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a hash table indexed from 0 to 6. What will be the final location of key 11?

A hash function defined as f(key) = key mod 7 with linear probing is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6. What will be the location of key 11?

Use the hash function: h(element) = element % 6 to store the collection of numbers 12, 2, 4, 15, 19, and 59 in a hash table. What is the index of the values 59, 4, 2, and 15 respectively in the hash table?