Question: A file has r=20,000 student records of fixed-length. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), MAJORDEPTCODE (4 bytes), MINORDEPTCODE (4 bytes), CLASSCODE (4 bytes, integer), and DEGREEPROGRAM (3 bytes). An additional byte is used as a deletion marker.

(a) Compute the record size R in bytes.
(b) Compute the blocking factor bfr and the number of file blocks b assuming an unspanned organization.
(c) Suppose the file is ordered by SSN; compute the number of blocks it takes to search for a record given its SSN value by doing a binary search.