Topic is Hashing 1 - Suppose keys are hashed to four-bit sequences. Also suppose that blocks can hold three records. If we start with a linear hash table with two empty blocks (i.e. buckets) (corresponding to 0 and 1), show the organization after we insert records with hashed keys ( 14 entries): 0000, 0001, 0010, ... 1011, 1100, 1101 (show a few intermediate steps). 2- Repeat the same process for an extendible hash table. 3- Remove the keys above from the linear hash table in the same order of arrival, i.e., remove them in the following order: 0000, 0001, 0010, ... 1011, 1100, 1101 (show a few intermediate steps)..