Consider a disk queue holding requests to the following cylinders in the listed order:
a) 116,
b) 22,
c) 3,
d) 11,
e) 75,
f) 185,
g) 100,
h) 87.
using the 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?
a) 116 - 22 - 3 - 11 - 75 - 185 - 100 - 87
b) 100 - 116 - 185 - 87 - 75 - 22 - 11 - 3
c) 87 - 75 - 100 - 116 - 185 - 22 - 11 - 3
d) 100 - 116 - 185 - 3 - 11 - 22 - 75 - 87