Suppose that a disk drive has 3000 cylinders, numbered 0 to 2999. The drive is currently serving a request at cylinder 114, and the previous request was at cylinder 112. The queue of pending requests, in FIFO order, is 360, 1470, 913, 1274, 96, 509, 122, 1750, 108. Starting from the current head position, what is 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. SSTF b. LOOK c. C-SCAN