Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Size (msec) Priority 2 (Silver) 1 (Gold) 3 (Bronze) 2 (Silver) 3 (Bronze) 1 (Gold) 10 J2 J3 JA...

Extracted text: Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Size (msec) Priority 2 (Silver) 1 (Gold) 3 (Bronze) 2 (Silver) 3 (Bronze) 1 (Gold) 10 J2 J3 JA J5 J6 8 3 3 10 4 12 1 15 4 a) Draw a Gantt chart showing FCFS scheduling for these jobs and find average waiting time. b) Draw a Gantt chart showing (non-preemptive) SJF scheduling and find average waiting time c) Draw a Gantt chart showing non-preemptive PRIORITY scheduling and find average turn-around time. d) Draw a Gantt chart showing preemptive PRIORITY scheduling and find average waiting time. e) Which of the foregoing scheduling policies provides the lowest waiting time for this set of jobs? What is the waiting time with this policy?