Assume one file has r=10^6 records. Each record takes R = 100 bytes, of which 10 bytes are for the key of the record. Suppose the key values range from 1 through 1,000,000, inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node pointer, or data record pointer) takes 10 bytes.

a. What is the order P of the B+-tree for the leaf node if B+-tree access structure on the key is constructed?

b. What is the total number of blocks required by the B+-tree?

c. What is the number of block accesses needed to search for and retrieve a record from the file --given its key value by using B+-tree?