Consider a file that has r = 100,000 EMPLOYEE records. Each record has an SSN field of size (9 bytes), and a Department Code field of size (29 bytes). The record includes other fields that makes the total size of the record to (50 bytes). Assume the storage disk has block size = 512 bytes and the block pointer size is (6 bytes)

Suppose that the file is ordered on non-key field department code and we want to create a clustering index on department code that uses block anchors (assume that each department code value starts at the beginning of new block and can span multiple contiguous blocks i.e. order after each other on disk). Assume there are 2,000 distinct department code values and the records are evenly distributed among these values. Repeat the calculation :. 5.The index blocking factor bfri (also known as the index fan-out fo). ii. The number of first-level index entries and the number of index blocks. iii. The number block accesses needed to search for and retrieve a record from the file using the primary index file. iv. The number of index levels if we convert the index into multilevel index. v. The total number of blocks needed for the multi-level index. vi. The total number of block accesses needed to access and retrieve a record.