Consider a disk with block size B-512 bytes. A block pointer is P 6 bytes long, and a record pointer is PR 7 bytes long. A le has r = 30000 EMPLOYEE records of xed- length. Each record has the following fields NAME (30 bytes), SSN (9 bytes), DEPARTMENT CODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOB CODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. Assume that unspanned organization is used to store file records. a. Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN i. The number of block accesses needed to search for and retrieve a record from the file given its SSN value and using the primary index is ordered by the key eld SSN and we want to construct a secondary index on SSN i. The index blocking factor bfri ii. The number of index entries ii. The number of index blocks. iv. The number of block accesses needed to search for and retrieve a record from the file given its SSN value and using the secondary index (on SSN). b. Suppose the le is not