A disk queue is holding requests to the following cylinders in the order: $110,12,15,20,70,145,90,80.$ What is the order that the requests are serviced for the algorithms listed below, assuming the disk head is at cylinder $45.$ The disk has a total of $200$ cylinders $(0-199).$ Hint: For SCAN, pay attention to the direction the read$/$write head is moving.

FCFS scheduling

SCAN scheduling $($arm is moving from cylinder $45$ towards cylinder $0)$

C$-$SCAN scheduling

Which algorithm gives the best result $($i$.$e$.,$ services all the requests with the minimum amount of head movement$).$