Question 26 2 pts Suppose that a disk drive has 200 cylinders, numbered 0 to 199. Consider a disk queue holding requests to the following cylinders in the listed order: 105, 20, 2, 9, 72, 178, 97, 82. Using the C-SCAN scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders? 97-105-178-199-82-72-20-9-2 97-105-178-2-9-20-72-82 97-105-178-199-0-2-9-20-72-82 97-105-178-82-72-20-9-2 82-72-97-105-178-20-9-2