c++ programm

using class

Consider the following set of processes, with the length of the CPU burst given in milliseconds: Burst Arrival Process time Time PO 2 0 P1 6 1 p2 1 P3 41 P4 8 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. 4 7 3