Suppose that a disk drive has 10000 cylinders (numbered 0-9999). It has just finished a request at cylinder 188, and the previous request was at 102. The queue of pending requests (in FIFO order) is: 12, 7650, 867, 323, 9878, 444, 3827, 7878, 587. Starting at the current position, calculate the total distance (in cylinders) that the disk arm must move to satisfy all the pending requests for each of the disk scheduling algorithms: a. FCFS d. LOOK b. SSTF c. SCAN e. C-LOOK f. C-SCAN