A3Q3.c - You are to write a C program that implements the following disk scheduling algorithms: a. FCFS [10 marks] b. SCAN [10 marks] c. C-SCAN [10 marks] d. SSTF [10 marks] e. LOOK [10 marks] f. C-LOOK [10 marks] • Your program will service a disk with 300 cylinders numbered 0 to 299. • • • • The program will service the requests (a list of 20 cylinder numbers) given in the file request.bin. This file contains (4 byte) integer values representing requests ranging from 0-299. Your program will take the initial position of the disk head as the first command line argument and the direction of the head as the second command line argument. It will then output the requests in the order in which they are serviced, and the total amount of head movements required by each algorithm. In particular, your program needs to do the following: Your program should take two command line arguments a) First command line argument - initial position of the disk head (an integer value) b) Second command line argument - direction of the head (LEFT or RIGHT) 2) Read the requests from the binary file (requests.bin), and store these requests in an integer array (for example: requests), after which you need to close the file. 3) Write functions for each disk scheduling algorithm. 4) The scheduling algorithms will service requests present in the requests array. 5) Since the requests are serviced in an order by the scheduling algorithms, you may need to first sort the requests in the requests array in an increasing order and store the sorted requests in another integer array (for example: sortedrequests). These algorithms will then service the requests in the sortedrequests array and compute the head movements. 6) You can use any sorting algorithm of your choice. You should simply analysis whether your sorting algorithm is efficient or not. 7) Your program should output the following (see sample output given below): a) Requests in the order in which they are serviced by each algorithm. b) Total amount of head movement incurred by each algorithm while servicing all the requests.