Implement a non-preemptive First Come First Served (FCFS) [results provided] algorithm.

Simulate and Evaluate it with the set of 8 processes below.

PLEASE USE ONLY USE C, C++, or JAVA

	FCFS
CPU Utilization	82.02%
Avg Waiting Time (Tw)	285.875
Avg turnaround Time (Ttr)	691.5
Avg Response Time (Tr)	36.25

1. 2. 3. 4. All processes are activated at time 0 Assume that no process waits on I/O devices. After completing an IO event, a process is transferred to the ready queue. Waiting time is accumulated while a process waits in the ready queue. Process Data: process goes {CPU burst, I/O time, CPU burst, I/O time, CPU burst, I/O time last CPU burst P1 14,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2) P2 (18,31,19,35,11,42,18,43,19,47,18,43,17,51,19,32,10) P3 16,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5) P4 17,42,19,55,20,54,17,52,15,67,12,72,15,66,14) P5 (5,81,4,82,5,71,3,61,5,62,4,51,3,77,4,61,3,42,5) P6 10,35,12,41,14,33,11,32,15,41,13,29,11) P7 121,51,23,53,24,61,22,31,21,43,20) P8 111,52,14,42,15,31,17,21,16,43,12,31,13,32,15) 1. 2. 3. 4. All processes are activated at time 0 Assume that no process waits on I/O devices. After completing an IO event, a process is transferred to the ready queue. Waiting time is accumulated while a process waits in the ready queue. Process Data: process goes {CPU burst, I/O time, CPU burst, I/O time, CPU burst, I/O time last CPU burst P1 14,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2) P2 (18,31,19,35,11,42,18,43,19,47,18,43,17,51,19,32,10) P3 16,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5) P4 17,42,19,55,20,54,17,52,15,67,12,72,15,66,14) P5 (5,81,4,82,5,71,3,61,5,62,4,51,3,77,4,61,3,42,5) P6 10,35,12,41,14,33,11,32,15,41,13,29,11) P7 121,51,23,53,24,61,22,31,21,43,20) P8 111,52,14,42,15,31,17,21,16,43,12,31,13,32,15)