On a disk with 1000 cylinders, number 0 to 999, compute the number of tracks the disk arm must move to satisfy all the requests in the disk queue. Assume the last request serviced was at track 345 and the head is moving toward track 0. The queue in FIFO order contains requests for the following tracks: 123, 847, 692, 475, 105, 376. Perform the computations for the following disk scheduling algorithms: a) FCFS SSTF SCAN Increasing Track C-SCAN - increasing Track LOOK - increasing Track e) [3 marks] [3 marks] [3 marks] [3 marks] [3 marks]