(athe file is stored on series of contiguous tracksas few tracks as possible (bthe file is spread randomly across the disk in kb clusters show your calculations at the end of the fastest disk drive could find specifications for was the maxtor atlas this drive had nominal capacity of gb using platters ( surfacesor gb/surface assume there are , tracks with an average of sectors/track and bytes/sector the disk turns at , rpm the track-to-track seek time is ms and the average seek time is ms how long will it take on average to read mb fileassuming that the first track of the file is randomly placed on the diskthat the entire file lies on contiguous tracksand that the file completely fills each track on which it is found show your calculations using the specifications for the disk drive given in exercise calculate the expected time to read one entire trackone sectorand one byte show your calculations using the disk drive specifications given in exercise calculate the time required to read mb file assuming (athe file is stored on series of contiguous tracksas few tracks as possible (bthe file is spread randomly across the disk in kb clusters show your calculations prove that two tracks selected at random from disk are separated on average by one third the number of tracks on the disk assume that file contains one million records sorted by key value query to the file returns single record containing the requested key value files are stored on disk in sectors each containing records assume that the average time to read sector selected at random is ms in contrastit takes only ms to read the sector adjacent to the current position of the / head the "batchalgorithm for processing queries is to first sort the queries by order of appearance in the fileand then read the entire file sequentiallyprocessing all queries in sequential order as the file is read this algorithm implies that the queries must all be available before processing begins the "interactivealgorithm is to process each query in order of its arrivalsearching for the requested sector each time (unless by chance two queries in row are to the same sectorcarefully define under what conditions the batch method is more efficient than the interactive method againthis track layout does does not account for the zoned arrangement on modern disk drives