Consider a disk with 256 cylinders, indexed from 0 to 255, with 0 being the innermost and 255 being the outermost cylinder. The system receives disk requests on the following tracks in the specified order:92, 96, 60, 46, 11, 137, 204, 94, 128, 89The head is currently on cylinder 58, and is moving towards inner cylinder (cylinder 0). Give the total number of tracks traversed for the given requests using each of the following algorithms.(a) FCFS scheduling(b) SSTF scheduling(c) SCAN scheduling(d) C-SCAN scheduling, servicing requests as head moves outwards(e) LOOK scheduling
(f) C-LOOK scheduling, servicing requests as head moves outwards