$(85$ bytes$),$ PHONE $(20$ bytes$),$ Birth$\_$date $(8$ bytes$),$ Sex $(1$ byte$),$ Major$\_$dept$\_$code $(4$ bytes$),$ Minor$\_$dept$\_$code $(4$ bytes$),$ Class$\_$code $(4$

bytes, integer$),$ and Degree program $(46$ bytes$),$ an additional byte is used as a deletion marker.

Consider the block size $B=512$ bytes, and blocking factor $B$ fr is the record size$).$

Also, for an index on the SSN field, assume the field size $Vssn=32$ bytes, assume the record pointer size $Pr=16$ bytes. $($Notec show

your computation completely to get the whole points for each section$).$

Calculate the record size R in bytes.

Calculate the blocking factor bfr and calculate the number of file blocks $b,$ assuming an unspanned organization

Calculate the number of block accesses needed to search and retrieve a record from the file, given its Ssn value and

using the primary index.

Use the editor to format your answer