Suppose that we have an ordered file with r = 300,000 records stored on a disk with block size B = 4,096 bytes. The length of the record is 100 bytes. 

 

1. Compute the number of block accesses required to search for a record. (6.25 marks) 

 

1. Now suppose that the ordering key field of the file is V = 9 bytes long, a block pointer is P = 6 bytes long, and we have constructed a primary index for the file. Compute the number of block accesses required to search for a record using the primary index.