5. A disk drive has 200 cylinders. The following requests 60, 100, 40, 120, 140, 20, 180 come to access the disk. (Each number represents a cylinder.) The read/write head just finished the request 110; it is at the position 80 now. List two different disk scheduling method and show graphically the order in which the above cylinders are accessed. What is the order that the disk arm moves to satisfy all the pending requests? Also draw the timeline for each of the following disk scheduling algorithms? a. Method: SCAN (5 points) b. C-LOOK (5 points)