Using c++ or java language

README.txt (this is a description on how to compile and run your source code based on the sample input given) src/(a folder containing all the source code of your program, do not include any binary files here) sample input and output (text files labeled as inputfile1.txt and outputfile1.txt and etc, for each sample cases for each program you have) Part 1 - Disc Scheduling FCFS, SCAN or C-SCAN 1. Write a program that will calculate the total head movement for either one of this algorithms (FCFS, SCAN or C-SCAN) for all test cases 2. Your input file starts with the case number, number of tracks, starting track, and the sequence of track numbers it will be accessing // input file Case 1, 199, 98, 183, 37, 122, 14, 124, 65, 67 Case 2, 199, 98, 183, 37, 122, 14, 124, 65, 68 Case 3, 199, 98, 183, 37, 122, 14, 124, 65, 69 Case 4, 199, 98, 183, 37, 122, 14, 124, 65, 70 3. Remember the track starts at 0 4. A sample output file will look like the following. FCFS algorithm Case 1, 640 Case 2, 641 Case 3, 642 Case 4,643 Part 2 - Page Replacement Algorithm 1. Write a program that will calculate the page faults when using LRU 2. Your input file starts with the case number, number of frames, and the sequence of page request 3. Sample input file //input file Case 1,3,7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1 Case 2,3,7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,0 Case 3,3,7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,2 4. A sample output file will look like the following. LRU algorithm Case 1, 15 faults Case 2, 14 faults Case 3, 14 faults