5.17 Consider the following set of processes, with the length of the CPU burst given in milliseconds: Burst time 5 3 Priorit 4 1 2 2 3 Process P3 4 The processes are assumed to have arrived in the order Pi, Pa, Ps, Pa, Ps, all at the time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger priority number impjies a higher priority), and RR (quantum - 2) a