Let be a disk with $5,000$cylinders numbered from $0$to $4,999.$The disk is currently fulfilling a request on cylinder $143,$while at the previous time it was on cylinder $125.$The queue of pending requests in FIFO order is as follows:

$86,1470,913,1774,948,1509,1022,1750,130.$

Starting from the current position of the arm how long will it take the system to satisfy the requests in each of the following disk scheduling algorithms? Assume that it takes $5$units of time to move from one cylinder to the next.

$1.$FCFS $($First Come First Served$)$

$2.$SSF $($Shortest Seek First$)$

$3.$SCAN $($elevator algorithm $$but it reaches the edges of the disk, even if it has no request for those cylinders$)$

$4.$LOOK $($elevator algorithm $$does not reach the edges of the disk if there is no request for those cylinders$)$

$5.$C$-$SCAN $($circular elevator algorithm $$reaches the end, in the direction it is moving and then jumps to the other end of the disk and continues without changing direction$)$

$6.$C$-$LOOK $($circular elevator algorithm $$when it reaches the last request in the moving direction, it jumps and goes to the farthest one and continues without changing direction$)$