This question is on my operating system class. please make sure your work is correct and I promise to give you a thumbs up

1) Consider the following set of processes, with the length of the CPU burst time given in milliseconds Process P1 P2 P3 P4 P5 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0 Burst Time Priority 10 3 a. Draw 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 (quantum - 1) b. What is the turnaround time of each process for each of the scheduling algorithms in part a? c. What is the waiting time of cach process for cach of these scheduling algorithms? d. Which of the algorithms results in the minimum average waiting time (over all processes)