1. Given hash function of key % 10. Start with an empty HashTable of size 10 ( indices 0 -9). Determine all correct statement after the following operations have been executed using linear probing. Hashinsert(valsTable, item 13) Hashinsert(valsTable, item 23) Hashinsert(valsTable, item 103) HashRemove(valsTable, 23) Bucket at index 4 is Empty After Removal All buckets except those at indices 3, 4, and 5 are Empty Since Start Bucket at Index 4 is Empty Since Start bucket at index 3 is Empty Since Start 2. Consider the double hashing with h1(key) = key % 10 and h2(key) = key %20. Consider a table with 20 buckets ( table indices 0 - 19). Give the first two buckets probed by this double hashing strategy for the key = 59 9, 19 9, 18 9, 28 9,8