Assume a situation where we have a relation FACULTY with primary key fid $(6$ bytes$)$ which defines the ordering of the records in the data file, and another non$-$ordering key field $($unique$)$ PAN# $(7$ bytes$).$ The record length is $95$ Bytes. We are required to store $687000$ records of FACULTY relation on a disk file. The block size is $1024$ Bytes. The address of any disk$-$block needs $4$ Bytes. Now we need to build secondary index $($one level only$)$ on non$-$ordering key field $($unique$)$ PAN# $.$

Now do the following.

$1.$Give how many data blocks are needed to store the records of FACULTY relation.

$2.$Give number of index blocks required in the indexing scheme done on PAN# attribute.

$3.$Give the number of block accesses needed to retrieve a record with given PAN# value from the file using the proposed secondary indexing structure.

Note: Assume unspanned record organization.