Exercise 3 P1 Let P1, P2, P3, P4 and P5 the processes with the following: Process Arrival time 0 P2 3 P3 4 P4 1 P5 13 Burst time 7 3 1 8 4 1) Determine the average waiting time using FCFS (First-Come, First-Served). What is the drawback of the FCFS scheduling? 2) Determine the order of execution and the average waiting time using SJF (Shortest Job First) with preemption and without preemption. 3) Determine the average waiting time for all processes using Round-Robin scheduling with quantum=3. 4) Which is the best scheduling algorithm in this case