// Assume a table size N = 10 // Hash function h(k) = k % 10…
// Assume a table size N = 10 // Hash function h(k) = k % 10 int[] keys = {12, 22, 35, 42}; If the keys above are inserted into a hash table using Linear Probing in the order shown, at what index will the key 42 be stored?