Process Burst Time Priority Arrival Time P1 8 2 0 P2 5 3 6 P3 1 1 8 P4 2 5 9 P5 6 4 10 Problem1 (40 pts) Consider the following set of processes, with the length of the CPU 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) Note: for the RR consider that the arriving time is O for all processes b. What is the average waiting time of each process for of the above scheduling algorithms? (10 pts) P1 P2 P3 P4 P5 Average FCFS SJF Priority RR