12. Program a simulation of a job scheduler for an operating system. Your scheduler will read in a list of jobs with the relevant information and output the order of completion along with the time of completion for each job and other relevant statistics. Implement 3 scheduling that were discussed in class. a. First Come, First Served (batch, non preemptive) b. Shortest Job First (batch, non preemptive) c. Round Robin (preemptive) Use C or C++ on a Linux machine. Below is an example of an input file. This is the input that generated the example output. ProcessID 100 101 102 103 104 105 106 Arrival 0 6 8 12 19 30 35 cpuBurst 10 10 4 20 15 5 10 Priority 1 1 1 1 1 1