a. Assume that there are 10000 Student records of size 200 bytes stored in hard disk with block size 1024 bytes; the size of the primary key is 5 bytes. Identify the total number of binary searches required if it follows secondary (Candidate key) indexing technique. b. Mention any two differences between dense indexing and sparse indexing. c. Differentiate B tree and B+ tree.