This assignment is to assess various CPU-scheduling algorithms. To answer these questions, you need to review Chapter 6 "CPU Scheduling" which is available in course materials Please be descriptive and comprehensive and avoid short and ambiguous answers Answers that are ambiguous will reduce your marks. Please input your responses into this file and submit it through Blackboard (no hard copy). Let's save some trees. 1. Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priorityl P1 P2 P3 P4 P5 13 10 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum 4) . b. What is the turnaround time of cach process for cach of the scheduling algorithms in part a? c. What is the waiting time of cach process for cach of these scheduling algorithms? d. Which of the algorithms results in the minimum average waiting time (over all processes)? English (Aus)