0 5 10 10 5 18 20 Task 1. Total 20% Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, base all decisions on the information you have at the time the decision must be made. An operating system is going to schedule the following processes: Process Arrival Time Burst Time P 3 11 Ps PA 15 10 9 PM 25 3 Besides the processes listed above, the system also has an idle task identified as Po which consumes no CPU resources. This special task is scheduled whenever the systein lus no other available processes to run. Consider the following scheduling algorithms: 1. FCFS (First Come First Served) 2. SJF (Shortest Job First) (Nonpromptive) 3. SRT (Shortest Remaining Time) For each of the algorithm: (a) Show the scheduling order of the processes using a Gantt chart or a table. In particular, clearly show the start and finish times of theses processes. (b) Find out the turnaround time, waiting time and the response time for each process. (c) Find out the average turnaround time for these processes (d) Find out the CPU utilization rate. Give your answer in fraction or in percentage