Problem:Write a program to simulate the work of processes scheduler by using RR algorithm. Theprogram should have three classes which are:1. Process Class: This class represents the process where it has process id, executetime and completion time. Arrival is assumed to be zero all times. Process id shouldbe unique and the class create it for each process. Provide the required methodsaccordingly.2. RRSchedule Class: This class represents the work of the scheduler. It has mainlytwo lists of processes, quantum size, and clock. One of the list will be as a recordof the processes while the other is to work on to execute the process in CPU. Theclock should be a simple counter to represent timing to run the list of processes.The method list should be as following:a. Pop method: to remove the process from the top of the list.b. Push method: to insert the processes at the end of list after it is interruptedand still has to go to CPU again.c. RunRR method: to represent the job of RR scheduler. You may need toadd more methods to serve/help this method. O COMP2202_SP2022_HW2_Proble x+A elearn.squ.edu.om/pluginfile.php/1669149/mod_resource/content/0/COMP2202_SP2022_HW2_Problem_Updated.pdfCOMP2202_SP2022_HW2_Problem2 / 55 |100% +| 0 0The scheduling will work as following:P,P2P3P,P,P,P,P,0 4 7 101418222630Therefore, P, needs 24/4=6 slots to execute in CPU where each slot is 4 ms. However, P2and P3 needs one slot each.Operation system scheduler can be evaluated by turnaround time and waiting time.Turnaround time is the amount of time to execute a particular process which can becalculated as following:turnaround time=completion time – arrival timeThe waiting time is the amount of time a process has been waiting to get CPU which canbe calculated as following:waiting time= turnaround time – execution timeAccording to the information above turnaround time and waiting time can be calculatedfor each process as below (time measured in ms):ExecutionWaitingtimeProcessArrivalCompletiontimeTurnaroundtimetimetimeP1243030P2374P3310107Problem:© COMP2202_SP202.pdf© Lab7.pdf© HW1_COMP2002_.pdfInagene Branding.jpgRebranding for Be.jpgShow all9:22 PMO Type here to search[]民3/8/2022HiIJAi80°F4) ENG出 O COMP2202_SP2022_HW2_Proble x+A elearn.squ.edu.om/pluginfile.php/1669149/mod_resource/content/0/COMP2202_SP2022_HW2_Problem_Updated.pdfCOMP2202_SP2022_HW2_Problem1 /5 |100% + | B OIntroduction:In computing, Operating System(OS) is a system software that manage the work betweensoftware (e.g. applications) and hardware(keyboard, screen, ..etc.). Examples of OS,Windows, Linux, MAC, IOS, and Android. OS can manage the CPU work by providingprocesses scheduler that decides which process should run in CPU at certain time. Processcan be any active running program/application on your computing device. For example,you can access in parallel MS Word and browsing internet, and compiling your code inNetBeans. Each application is a process and need CPU to execute/run it.Round-Robin(RR) algorithm is used as processes scheduling in OSs. Each process is givenan equal time slot (quantum ) to run in the CPU then it is interrupted in circular order'.Therefore,the number of slots for a processes i = total execution time of processes i / quantum lengthSuppose that the processes arrive at time 0 milliseconds(ms) in the order: P1, P2 , P; as inthe following table with execution time of each process and the quantum time is 4 ms.Process nameExecution timePo24P23'Read More: https://en.wikipedia.org/wiki/Round-robin_scheduling1|© COMP2202_SP202.pdfG Lab7.pdf© HW1_COMP2002_.pdfD Inagene Branding.jpgO Rebranding for Be.jpgShow all9:22 PMO Type here to search[]民3/8/2022IJAi80°F4) ENG近出

Question

Accepted Answer

Since no programming language is mentioned, I have done it in Java.
I have implemented the given…