Solve the database problem

2. Consider a file with a secondary dense index structure on a non-ordering key field where 120,000 records stored on a disk with block size of 2048 bytes. Length of every record is of fixed and un-spanned. Record size is 150 bytes. Also consider, every record of index file is 20 bytes long. Now assume every block access requires 0.015 second. Can you measure the average improvement in time? (4)