Goal Practice solving scheduling problems. Output Complete the following tasks and submit it to the correlating assignment submissions folder. Supply screenshots to support your answers. Procedure Consider the following set of processes with the length of CPU burst given in milliseconds. Assume the processes arrive in the specified order (P1, P2, .), but ignore the arrival delay, unless instructed otherwise Processes with the length of CPU burst given in milliseconds Process Burst Time (ms) Priority Arrival time (ms) 10 P2 P3 4 4 P5 Tasks 1. What is the average waiting time if FCFS algorithm is used? Ignore the arrival delay 2. What is the average waiting time if processes arrive in the reverse order (P5, P4, , P1) and FCFS algorithm is used? Ignore the arrival delay 3. What is the average waiting time if SJF algorithm is used? Ignore the arrival delay 4. What is the average waiting time if SJF with preemption algorithm is used? Use "Arrival time" column 5. What is the average waiting time if nonpreemptive priority algorithm is used? Use "Priority" column. 6. What is the average waiting time if RR (quantum 1) algorithm is used? Ignore the arrival delay. 7. What is the average waiting time if RR (quantum 2) algorithm is used? Ignore the arrival delay 8. What is the average waiting time if processes arrive in the reverse order (P5, P4, , P1) and RR (quantum 2) algorithm is used? Ignore the arrival delay 9. What is the average waiting time if RR (quantum 4) algorithm is used? Ignore the arrival delay. 10, what is the average waiting time if processes arrive in the reverse order (P5, P4, , P1) and RR (quantum = 4) algorithm is used? Ignore the arrival delay