Suppose following sequence of disk track requests: 27, 129, 110, 186, 147, 41,10, 64, 120. Assume the disk head is initially positioned over track 100 and is moving in the direction of decreasing track number. a. Compare the disk scheduling algorithms with respect to the next accessed track and number of traversed tracks for FIFO, SSTF, SCAN and C-SCAN. b. What is the average seek length time for each of the algorithms?   PLEASE DO FOR FIFO, SSTF, SCAN and C-SCAN. NOT FOR C-LOOK. The previous answer you gave me was for C-LOOK. Thanks.

Suppose following sequence of disk track requests: 27, 129, 110, 186, 147, 41,10, 64, 120. Assume the disk head is initially positioned over track 100 and is moving in the direction of decreasing track number.
a. Compare the disk scheduling algorithms with respect to the next accessed track and number of traversed tracks for FIFO, SSTF, SCAN and C-SCAN.
b. What is the average seek length time for each of the algorithms?

PLEASE DO FOR FIFO, SSTF, SCAN and C-SCAN. NOT FOR C-LOOK. The previous answer you gave me was for C-LOOK.

Thanks.