c or c ++ and Gantt chart

IDE: C/Ct+, Java Background: 3a. First Come First Serve Process Scheduling For FCFS scheduling algorithm, you shall get the number of processes/jobs in the system and their CPU burst times. This is a non-preemptive scheduling where a process getting the CPU will funish its works and the leave the CPU after it exhausts its required CPU time. The scheduling is performed on the basis of arrival time of the processes irrespective of their other parameters. Each process will be executed according to its arrival time. The waiting time and turnaround time of each of the processes can be calculated as well as the average system tumaround and waiting time. Average Waiting Time: (12+0+5)/35.66 Average Turnaround Time: (17+7+14)/3=12.66