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 file has r = 80,000 EMPLOYEE records of fixed length. Each record has the following fields: NAME (25 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (8 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes).

Based on the information below, consider this different situation. This time you are building a primary index on SSN using B+tree. Calculate:

(i) the order p for the B+tree,

(ii) the number of levels needed if blocks are approximately 69% full (round up for convenience)

(iii) the worst-case number of blocks needed to search for and retrieve a record from the file-given its SSN value-using the B+tree you are estimating.