Question 6: Consider the following set of processes, their arrival times, length of the CPU burst time given in milliseconds ProcessArrival TimeBurst Time Priorit P1 P2 P3 P4 P5 12 Let us schedule the execution of these processes using the following scheduling algorithms: First Come First Served (FCFS), Shortest Job First (SJF), Round Robin (RR), and a new type of scheduling algorithm called non-preemptive priority scheduling. The following are the assumptions 1) Larger priority number implies higher priority 2) Assume the quantum (aka time slice) of 2 for RR algorithm 3) Non-Preemptive means once scheduled, a process cannot be preempted (i.e. it runs to completion) 6a [10 points] What is the response (completion) time of each process for each of the scheduling algorithms. Write the times in the table below FCFS Priorit P1 P2 P3 P4 P5 6b [10 points] Which of the above methods results in the longest average wait time. Show calculations and explain