Q$9.$ Suppose that we have an ordered file with $r=60000$ record stored on a disk with block size, $B=512$ bytes. File records are of fixed size with record length $R=80$ bytes.

$($a$)(6\%)$

$(1)$What$\text{'}$s the blocking factor for the file? What's the number of blocks needed for file?

$(2)$How many block accesses would be needed to do a binary search for ordering field on the data file?

$(3)$How many block accesses in average would be needed to do a linear search for non$-$ordering field on the data file?

$($b$)(2\%)$ Assume that we have constructed a primary index for the file that the ordering key field of the file is $12$ bytes long and a block pointer that is $8$ bytes long.

How many block accesses would be needed to search for a record using the primary index?

$($c$)(8\%)$ Assume that we have constructed a secondary index on a non$-$ordering key field of the file that is $12$ bytes long and a block pointer that is $8$ bytes long.

$(1)$ What's the total number of index entries for the file? What's the total number of blocks needed for the index?

$(2)$ How many block accesses would be needed to search for a record using the secondary index?

The above index, which is constructed based on a non$-$ordering key field, is called a first level index. Assume that a second$-$level index has been constructed based on the first$-$level index to create a multilevel index.

$(3)$ What's the total number of index entries for the second$-$level index.

$(4)$ How many block accesses would be needed to search for a record using the multilevel index?