a. Suppose we have a table: Doctor (DOCNO INT, DocName INT, Specialization VARCHAR(10), Salary Float) and it has an extendible hashing index. The hash function h (k) uses two rightmost bits of binary value of the number k and global depth of the directory structure is 2. The bucket size is four records ie it can store upto 4 records. Insert the elements 13, 22, 4, 2, 19, 6, 14, 16, 26, 28, 8, 7,23,24 using extendible hashing technique. [6 M) b. "Indexing can be fruitful in optimizing the database when used tactfully." List two scenarios briefly, when indexing should NOT [2 M) BE used