1. Suppose that we have a file of 1,000 records stored on a disk with block/page size of 512 bytes. The length of each record is 40 bytes, the size of the key field is 10 bytes and pointer field size is 5 bytes. The system does not use spanning in storing records. Determine the average number of pages to be read while searching for a record based on the key field value. 2. Given the specifications in question 1 above, assume an index is built on the key field. If we search for a record given its key field value, determine the maximum number of pages to be read.

I just need number two