Consider an ordered file with r=30,000 records stored on a disk block size B=1,024 bytes. File records are fixed size and are unspanned, with record length R=100 bytes. (a) What is the blocking factor for the ordered file? 

(b)  Suppose that the ordering key field of the file is V=8 bytes long, a block pointer is P=4 bytes long, and a primary index is constructed for the file. What is the blocking factor for the primary index? 

(c) What is the total number of blocks needed to store the primary index? 

(d) How many block accesses are needed to retrieve a record using the primary index if a binary search is applied to the index file? 

(e) Suppose that a dense secondary index is constructed on a norordering key field of the file that is V=8 bytes long and a block pointer is P=4 bytes long. What is the total number of blocks needed to store the secondary index?

 (f) How many block accesses are needed to retrieve a record using the secondary index if a binary search is applied to the index file?