should be written to output file and screen. Recommendations \& Rules: - The application must be written in C/C++ programming language and must be compiled on GNU/Linux Operating Systems. - Don't use any special library for protocols when coding. Write your own functions if it's necessary. Only exemption is data structure functions that given in Data structures lecture. - You should commit changes on github system. Usually at least one time a day you should commit your code on github. - Unless otherwise explicitly specified, all written assignments or code that is submitted is to be entirely the student's own work. Using any code or copying any assignment from others is strictly prohibited without advance prior permission from the instructor. - All students' work is their own. Students who do share their work with others are as responsible for academic dishonesty as the student receiving the material. - Students who encourage others to cheat or plagiarize, or students who are aware of plagiarism or cheating and do not report it are also participating in academically dishonest behavior. - In this case (academically dishonest behavior), students to be punished with no grade. Project Details: 1. Program should have command argument options to get input data from a text file and command argument option for write output data. "-f" must be used for command argument and following text indicate input file name and "-o" for output file name. student@db: \$./cpe351 -f input.txt -o output.txt 2. This file should have three columns and unlimited rows. It must be text and fields should delimit by ":" character. Below table represent structure of this file. Some data fields may not use at decision process so you can omits the values. But every process should have three of these values. At the Appendix section input.txt file given as example. APPENDIX File input.txt sample content 5:0:34:1:23:1:14:2:23:3:1 output.txt/Screen output Scheduling Method: First Come First Served Process Waiting Times: P1: 0ms P2:4ms P3: 8ms P4: 10ms P5: 13ms Average Waiting Time: 7ms Scheduling Method: Shortest Job First - Non-Preemptive Process Waiting Times: P1: 0ms P2: 10ms P3: 4ms P4: 13ms P5: 5ms Average Waiting Time: 6.4ms Scheduling Method: Shortest Job First -Preemptive Process Waiting Times: P1: 6ms P2: 10ms P3: 0ms P4: 13ms P5: 1ms Average Waiting Time: 6ms Scheduling Method: Priority Scheduling -Preemptive Process Waiting Times: P1: 14ms P2: 6ms P3: 0ms P4: 9ms P5: 1ms Average Waiting Time: 6ms Scheduling Method: Priority Scheduling - Non-Preemptive Process Waiting Times: P1: 0ms P2: 10ms P3: 4ms P4: 13ms P5: 5ms Average Waiting Time: 6.4ms Scheduling Method: Round Robin Scheduling - time_quantum=2 Process Waiting Times: P1: 14ms P2: 9ms P3: 11ms P4: 11ms P5: 12ms Average Waiting Time: 11.4ms