make sure it gets input please

Project Objectives: This programming project is to simulate a few CPU scheduling policies discussed in the class. You will write a program to implement a simulator with different scheduling algorithms. The simulator selects a task to run from ready queue based on the scheduling algorithm. Since the project intends to simulate a CPU scheduler, so it does not require any actual process creation or execution. When a task is scheduled, the simulator will simply print out what task is selected to run at a time. It outputs the way similar to Gantt chart style. Project Descriptions: The selected scheduling algorithms to implement in this project are 1. First Come First Serve (FCFS). 2. Round Robin (RR). 3. Shortest Remaining Time First (SRTF). 4. Preemptive Priority (PP) The detailed algorithms are already described in class slides and textbook. Task Information The process information will be read from an input file. The format is pid arrival_time burst_time priority All of fields are integer type where pid is a unique numeric process ID arrival_time is the time when the task arrives in the unit of milliseconds burst_time the is the CPU time requested by a task, in the unit of milliseconds priority number (integer) is associated with each process Command-line Usage and Examples Usage proj input_file [FCFS|RR| SRTF|PP] [time_quantum] where input_file is the file name with process information. FCFS, RR, SRTF and PP are names of scheduling algorithms. The time_quantum only applies to RR. FCFS is nonpreemptive while RR, SRTF and PP are all preemptive. The last argument is needed only for RR