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