course operating system

please help me

please writ this soluiton her not as camscanner or book

way Neview nep Arrival Time P1 8 2 0 Problem1 (40 pts) Consider the following set of processes, with the length of the CPU Process Burst Time Priority burst times given in milliseconds: a. Draw four Gantt charts illustrating the execution of the processes using FCFS, Preemptive SJF, a non-preemptive priority, and a RR (quantum=2) scheduling. (30 pts) P3 Note: for the RR consider that the arriving time is 0 for all processes b. What is the average waiting time of each process for of the above scheduling algorithms? (10 pts) P2 5 3 3 6 1 1 8 8 P4 2 5 5 9 PS 6 4 10 Pi P2 P3 P4 P5 Average FCFS SJF Priority RR