A file directory contains $130$ directory entries and occupies one or more disk blocks. The block size is $1024$ bytes.

Under approach $1,$ each directory entry consists of a file name and all attributes associated with the file. The file

name occupies $15$ bytes and the attributes occupy t bytes.

Approach $1$

Under approach $2,$ each directory entry consists of a file name of $15$ bytes and a pointer $5$ bytes in size pointing to

the attributes $t$ bytes in size associated with the file.

For approach $2,$ determine the number of blocks that must be accessed to find the directory entry and read the

attributes if the given file name matches the last entry.

blocks

Determine the largest value of $t$ such that approach $1$ accesses the same number of blocks as approach $2$ to find

the last directory entry and read all attributes.

$t=Ex$:$5,$ bytes