Question 3 (20 points): Consider a system that has five jobs, with respective processing time requirements of 8, 2, 6, 4, and 5 units. Now consider a system that processes these jobs using the processor sharing discipline (e.g., the RR time-quantum is extremely small) (i) What is the average turnaround time for the jobs in this system? (ii) What is the average waiting time for the jobs? (ii) What is the throughput of this system? (iv) What is the minimum value for the turnaround time for a job in this system? (v) What is the maximum value for the turnaround time for a job in this system? Now consider the same system but with the scheduling discipline changed to FCFS. Answer the above six questions for this system for the worst case and the best case condition in terms of the average turnaround time for the jobs. (For this you will need to identify the order of these five jobs in the FCFS queue.)