Extendible Hashing: Consider an extendiblehashing structure that is initially empty and where each bucket canhold up to 2 records. Show the contents of extendible hashing afterinserting keys 8, 16, 4, 3, 11, 12 in order, using the lowest-bitsfor the hash function. That is, records in a bucket of local depthd agree on their rightmost d bits. Show the contents after eachdirectory doubling operation.
Answer