Assume one file has 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

11. What is the number of leaf-level blocks needed in B-+tree if the tree nodes are approximately 69% full (round up for convenience)?

12. What is the number of B-+tree internal nodes at the lowest level needed if blocks are approximately 69% full (round up for convenience)? (Please note this internal level is just above the B-+tree leaf node level).

13. What is the number of levels needed if internal nodes also 69% full (round up for convenience)?

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

15. 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?