Exercise 14.3.6: Suppose keys are hashed to four-bit sequences, as in our examples of extensible and linear hashing in this section. However, also suppose that blocks can hold three records, rather than the two-record blocks of our examples. If we start with a hash table with two empty blocks (corresponding to 0 and 1), show the organization after we insert records with hashed keys: a) 0000, 0001,...,1111, and the method of hashing is extensible hashing. b) 0000,0001,...,1111, and the method of hashing is linear hashing with a capacity threshold of 100%