3. [4 pts] Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Priority Number Burst time 10 5 2 The processes are assumed to have arrived in the order P1, P2, P3, Pt. Ps, all at time 0. Context switching time is negligible. A smaller priority number indicates a higher priority. (1) Use a Gantt chart to illustrate the execution of these processes using FCFS and compute the average waiting time. (2) Use a Gantt chart to illustrate the execution of these processes using SJF and compute the average waiting time. (3) Use a Gantt chart to illustrate the execution of these processes using non-premptive priority algorithm and compute the average waiting time. (4) Use a Gantt chart to illustrate the execution of these processes using RR (quantum = 1 millisecond) and compute the average waiting time