Implement the following CPU schedule algorithm (Round Robin (RR)) with the specified quantum using C. Assume that all jobs are CPU bound (i.e., they do not block for I/O), and the context-switching time is negligible. Also assume that in Round Robin if a new process arrives the same instant when a process is switched out, the new process gets in the ready queue first. The first command line argument specifies the file name which contains the list of processes for your scheduling algorithms. The next command line argument specifies the time quantum (for round-robin).

You must produce a Gantt chart for each scheduling algorithm to help visualize the sequence of execution for each process (See example output below). You will analyze the performance of these scheduling algorithms by tracking the turnaround time and waiting time for each process and printing the average waiting time, average turnaround time and throughput after all processes have completed.

machine:$./scheduler "processes.txt 4

Input: processes.txt

Which contains the ProcessID,Arrival Time,Burst Time

0,0,5 1,1,3 2,9,8

3,10,6

OUTPUT: