1.Question: Consider a hash table of size m=7. Draw the table that results after inserting the following keys: 19, 26, 13, 48 and 17 for each case: a. collision resolved with chaining, with hash function h(k)=k%7 b. collision resolved by linear probing, with hash function h1(k,i)=[h(k)+i] % 7 (i=0,1,..,m-1) c. collision resolved by quadratic probing, with hash function h1(k,i)=[h(k)+i²] % 7 (i=0,1,..,.m-1) d. collisions resolved by double hashing, with h2(k,i)=[h(k)+i*{5-(k%5)}]%7 (i=0,1,..,m-1)

Show the result when we insert the keys 5; 28; 19; 15; 20; 33; 12; 17; 10 into a hash table with collisions resolved by linked list at each slot. Let the hash table have 9 slots, and let the hash function be h(x) = (2x+1) mod 9. (You are expected to draw the final hash table)

Answer the following ture or false question 1. The 9-entry hash table that results from using the hash function, h(i) = (2i+7) mod 9, to hash the keys 12, 5, 13, 4, 10, 19, 8, 3, and 28, assuming collisions are handled by linear probing as follows: 0 1 2 3 4 5 6 7 8 10 19 3 28 12 8 13 4 5 Group of answer choices True False   2. Here is how the built-in sum function can be combined with Python’s comprehension syntax to compute the sum of all numbers in an n x n data set, represented as a list of lists: sum(sum(subset) for subset in data) Group of answer choices True False 3. Here is the comparison for asymptotic growth rate: (logn) < (n) < (nlogn) < (n^2) < (n^3) < (2^n) Group of answer choices True False   4. Here is the Python’s list comprehension syntax to produce the list of this 26 characters ['a', 'b', 'c', ..., 'z']: [chr(k) for k in range(97, 123)] Group of answer choices True False

Given the hash function: h(i) = i % 13Show the array after inserting the following keys: 18, 41, 22, 44, 59, 32, 31, 73, in this order. Use linear probing to resolve collisions.