suppose we have a table doctor (Doc no INT, Doc NAme INT, Specialization VARCHAR(10), Salary Float) and it has an extendible hashing index. The hash function h (k) use two rightmost bits of binary value of the number k and global depth of the directory structure is 2. The bucket size is four record that us it can store upto 4 records. Insert the elements 13, 22, 4, 2, 29, 6, 14, 16, 26, 28, 8, 7, 23, 24 using extendible hashing technique