Jump to level 1 valsTable: o 70 1 2 30 3 14 5 6 46 7 37 8 18 4 S Empty-since-start Empty-after-removal Occupied Hash table vals Table uses linear probing, a hash function of key % 10. The operation HashRemove(valsTable, 18) is performed. Ex: 1, 2, 3 What is the specific sequence of buckets probed by HashSearch(valTable, 18)? (commas between values) What is the specific sequence of buckets probed by HashSearch(valTable, 30)? (commas between values)

2. Consider the Linear Hashing index. Linear Hashing | h1 000 001 010 011 ho ठ 00 01 10 11 Mod 8 (%68) Mod 4 (%4) 16* 21* 40* 37* 14* 18* 6* Primary Page 13* A. Show the resulting index after inserting the entry 9* C. Show the resulting index after inserting entry 7* 31* 19* 11* 23* B. Show the resulting index after inserting the entry 3* 30* D. Show the resulting index after inserting the entry 22* Overflow Page

vals Table: o 1 2 3 4 5 6 7 8 9 10 30 21 Empty-since-start Empty-after-removal Occupied Hash table valsTable uses double probing with the hash functions hash1(key): key % 11 hash2(key): 5-key % 5 and a table size of 11. HashInsert(vals Table, item 63) inserts item 63 into bucket Ex: 10 HashInsert(vals Table, item 62) inserts item 62 into bucket HashInsert(vals Table, item 32) inserts item 32 into bucket

A linear probing hash table of length 10 uses the hash function h(x) = x mod 10 + 1. mod is the reminder operator. For example the h(42) = 42 mod 10 + 1 = 2 + 1 = 3 so we insert 42 in the position 3 in the array. After inserting 6 integer keys into an initially empty hash table, the array of keys is…

Exists a connected hash table of size m? What does a hash function accomplish? Give an instance.