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.

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

2. How many index blocks bi are needed to build the single level primary index?

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

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

5. What is the fan-out value if multi-level index is used?