Operating Systems - Assignment 1 Answer all the questions. Question 1 (50 marks) Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process . Arrival Time Priority 03 1 1 2 2 4 1 8 Burst Time 10 1 2 3 4 The processes are assumed to be arrived in the order P, P2, P3, P4, Ps a) Draw four Gantt charts that illustrate the execution for these processes using the following scheduling algorithms: FCFS, SJFS, SRTN, Priority (Preemptive and Non- Preemptive) and RR (quantum = 1). b) What is the turn-around time of each process for each of the scheduling algorithms in part(a)? c) What is the waiting time of each process for each of the scheduling algorithms in part(a)? d) Which of these algorithms results in the minimum average waiting time