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

What is the number of B-+tree internal nodes at the next highert level needed if blocks are approximately 69% full (round up for convenience)?

(Please note this internal level is just above the B-+tree lowest internal node level)

How many block accesses on the average are needed to fetch a record by doing linear search on the single level index part?

What is the least number of block accesses to fetch a record by using single level primary index with binary search?

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

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).