Consider a disk with 400 cylinders where the head is currently over cylinder 106. If the queue of equal priority cylinder access requests is 196, 366, 74, 244, 28, 248, 130, 134, calculate how many cylinders the head must move across for each of the following disk scheduling algorithms to satisfy all access requests. In all cases, show all your work.

• FCFS ( First Come First Served )

• SSTF ( Shortest Seek-Time First )

• C-SCAN

• C-LOOK