System for Deterministic Modeling of CPU Scheduling Algorithms You are required to apply the concepts of data structures and algorithms to design, analyze, implement, test, and document a System for...

System for Deterministic Modeling of CPU Scheduling Algorithms You are required to apply the concepts of data structures and algorithms to design, analyze, implement, test, and document a System for Deterministic Modeling of CPU Scheduling Algorithms described below:A. Each process P in the system can have the following attributes: A1. Arrival Time: the time when process P first makes a request to the CPU Scheduler to execute on the CPU. Each Arrival Time can be expressed as a nonnegative integer. A2. Sequence of CPU Computation Time and I/O Time Requirements which can each be expressed as a nonnegative integer (see example below). A3. Process Priority, expressed as a nonnegative number. (Process Priority Numbers will only be used when Priority Scheduling is applied. Lower Process Priority Numbers correspond to higher process priorities.) For example, for some process P: Arrival_Time(P) = 8; The Sequence of CPU Computation Time and I/O Time Requirements of process P could have 5 components as follows: (1) CPU_time(P) = 10; (P needs to execute 10 time units on the CPU at first) (2) I/O_time(P, 0) = 15; (then P needs to do I/O for 15 time units on I/O device 0) (3) CPU_time(P) = 16; (then P needs to execute 16 time units on the CPU) (4) I/O_time(P, 1) = 20; (then P needs to do I/O for 20 time units on I/O device 1) (5) CPU_time(P) = 8. (then P needs to execute 8 time units on the CPU before terminating) Process_Priority(P) = 2. Please note that the I/O time requirements only includes the time that is needed when a process P is actually doing I/O; it DOES NOT include the time that it may need to spend waiting in an I/O queue before the I/O device becomes available.B. At any point in time, each process P in the system can be in any one of the following states.(a) New: P has not arrived yet; (b) Running: P has been selected by the CPU scheduler for execution on the CPU, and is currently executing on the CPU; (c) Ready: P has already arrived, and P is currently waiting in the ready queue to be scheduled by the CPU Scheduler for execution on the CPU; (d) Waiting for I/O: P had previously made an I/O request to the I/O scheduler in order to perform I/O on an I/O device, and P is either currently performing I/O on an I/O device or is currently waiting in an I/O queue so that it can be scheduled by the I/O Scheduler to perform I/O on an I/O device; (e) Terminated: P has completed its sequence of CPU computation time and I/O time requirements.C.The System for Deterministic Modeling of CPU Scheduling Algorithms must provide the ability to use any one of the scheduling algorithms.C1. Nonpreemptive First-Come, First-Served (FCFS) SchedulingC2. Nonpreemptive Shortest-Job-First (SJF) SchedulingC3. Preemptive SJF (Shortest-Remaining-Time-First) SchedulingC4. Nonpreemptive Priority SchedulingC5. Preemptive Priority SchedulingC6. Preemptive Round-Robin (RR) SchedulingD. The following can be assumed regarding I/O devices and the I/O Scheduler: D1. There can exist any number of I/O devices in the system; D2. There is only one I/O queue for each I/O device; D3. I/O queues are scheduled by Nonpreemptive FCFS scheduling.E. For any given set of processes for which the Arrival Time, Sequence of CPU Computation Time and I/O Time Requirements, and Process Priority are given for each process, the system will be able compute the following for any of the CPU scheduling algorithms described aboveE1. Average Waiting Time; E2. Average Turnarounnd Time.Pls, give the comment and a clear explanation.