10 (3) Consider the following set of processes, with burst time given in milliseconds: Process Burst time Priority P1 3 P2 1 1 2 3 P4 3 4 P5 5 2 P3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. i. Draw four Gannt charts illustrating the execution of these processes using FCFS, SJF, non- preemptive priority (smaller priority number means higher priority), and RR (quantum=1) scheduling. ii. What is the waiting time of each process for each of the scheduling algorithms in (i)? iii. Which of the schedules in (1) results in the minimal average waiting time (over all processes)? iv. Which scheduling algorithm, as an operating systems designer, would you implement and why