i. What is the order P of the B+-tree if B+-tree access structure on the key is constructed?
ii. What is the number of leaf-level blocks needed if blocks are approximately 69% full (round up for convenience)?
iii. What is the number of levels needed if internal nodes also 69% full (round up for convenience)?
iv. What is the total number of blocks required by the B+-tree?
v. 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?