10 pts 3- Consider a disk with block size B - 8000 bytes. A file has r - 200,000 EMPLOYEE records of fixed length and are unspanned. Each records' length is 200 bytes. ta) Calculate the blocking factor bfr and the number of file blocks b needed for the file. How many block accesses are needed if a binary search applied to the data file? (b) Suppose that the file is ordered by the key field SSN and we want to construct a primary Index on SSN. The SSN key field is 4 bytes long and a block pointer is P-6 bytes long. Calculate the Index blocking factor fri and the number of index blocks How many block accesses are needed if a binary search applied to the Index ne