A file called STUDENT has r$=20,000$ fixed$-$length records. Each

record has the following fields: Name $(20$ bytes$),$ ID $(9$ bytes$),$ Address $(28$

bytes$),$ Phone $(10$ bytes$),$ BirthDate $(6$ bytes$),$ DegreeProgram $(4$ bytes$),$ and GPA

$(2$ bytes$).$ An additional byte is used as a deletion marker.

The file uses an unspanned record organization. It is stored on a hard disk with

the following parameters: $15$ single$-$sided platters, logical sector size B$=2048$

bytes, $16$ logical sectors per track, and $25$ tracks per platter, access time $($seek

time $+$ rotational delay$)$ of $4\mathrm{.}1$ms$,$ and data transfer time of $0\mathrm{.}1$ms per sector.

a$.$ Calculate:

i$.$ the record size l in bytes,

ii$.$ the blocking factor bfr$,$

iii. the number of blocks b$,$

iv$.$ the number of tracks t occupied by the file,

v$.$ the number of platters p occupied by the file.

b$.$ Consider the situation where the file is stored across contiguous tracks.

Also, consider a query on student ID $($i$.$e$.$ one record is being located in

the file$).$ Which type of file search on disk would be more efficient for

this query $$ a linear search or binary search? Explain.