RR round robin

Write a c++ program using class to solve?? Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst time Arrival Time PO 20 P1 6 1 P2 1 4 P3 4 7 P4 38 Draw Gantt charts that illustrate the execution of these processes and compute the average waiting time, average turnaround time, the response time for each process. Using the following scheduling algorithms: (1) non-primitive SJF (2) RR with time quantum = 1 ms