Your solution (containing all disk scheduling algorithms) should be submitted via D2L. All solutions are to be written in C 1. Write a program that implements the following disk scheduling algorithms: FCFS (F) .SSTF (T) . SCAN (S) .C-SCAN (C) LOOK (L) C-LOOK (O) Your program will service a disk with 10,000 cylinders numbered 0 to 9999. The program will read a series of cylinder requests (no maximum) and service them according to each of the algorithms listed above. The program will be passed two parameters on the command line: i) a letter indicating the algorithm to use; and ii) the initial position of the disk head. After execution the program will report the total amount of head movement required Your solution (containing all disk scheduling algorithms) should be submitted via D2L. All solutions are to be written in C 1. Write a program that implements the following disk scheduling algorithms: FCFS (F) .SSTF (T) . SCAN (S) .C-SCAN (C) LOOK (L) C-LOOK (O) Your program will service a disk with 10,000 cylinders numbered 0 to 9999. The program will read a series of cylinder requests (no maximum) and service them according to each of the algorithms listed above. The program will be passed two parameters on the command line: i) a letter indicating the algorithm to use; and ii) the initial position of the disk head. After execution the program will report the total amount of head movement required