A disk drive has 100 cylinders. The following requests come to access the disk. (Each number represent a cylinder):

A disk drive has 100 cylinders. The following requests come to access the disk. (Each number represent a cylinder): 26 37 100 14 88 33 99 12 Given that the read/write head is initially at position 26, compute the number of head movements in each of the following disk scheduling algorithms:a. FCFSb. SSTF c. SCAN(going up)d. C-SCAN(going up)e. LOCK((going up)f. C-LOCK (going up)