Commercic Proce PE P3 P4 PS The presente de P.F.P.PL Prithe following bugs TICES, per primer priority in RR (-2) FORST Senter the deather Prayed the Werner We than QUESTION 1 Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1 7 5 P2 2 4 P3 11 3 P4 9 1 PS S 3 The processes are assumed to have arrived in the order P1 P2, P3, P4, P5. all at time 0. a. Druw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum2), FCFS: Enter the order of the processes Enter times for above chart starting with SIF: Enter the order of the processes Enter the times for the above chart starting with O Priority: Enter the order of the processes Enter the times for the above chart starting with o Round Robin: Enter the order of the processes Enter the times for the above chart starting with D Click Save and Submitted and whit. Click Se All Antall