9. Suppose that a disk drive has 2000 cylinders, numbered 0 to 1999. The drive is currently serving a request at cylinder 130, and the previous request was at cylinder 70. The queue of pending requests, in order, is 70, 1110, 30, 870, 210, 110, 970,520, 40, 320 Starting from the current head position, what is the access sequence and the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests, for each of the following disk-scheduling algorithms? a. FCFS b. SSTF c. SCAN d. LOOK e. C-SCAN f. C-LOOK