Five jobs P1, ..., P5 arrive at a processor at time 0, 1, 2, 3, 4 and the lengths of their CPU burstsare 9, 1, 3, 1, 5, respectively. Draw the Gantt Chart and calculate the average waiting time and the average response time for the following policies a. SJF (Shortest-Job-First) scheduling policy.
b. SRTF (Shortest-Remaining-Time-First) scheduling policy.
c. P-PS (Preemptive priority ) scheduling policy with priority assignment (3, 2, 1, 4, 3) to (P1, ..., P5), where priority 1 is the highest priority. RR (Round-Robin) scheduling policy with a time quantum of 2.
d. MLFQ scheduling policy with simplification. We ignore priority boost and I/O and the detailed policy is as follows: A new job enters Q1 in Round-Robin (RR). When it gains CPU, job receives 1 time unit; If it does not finish in 1 time unit, it is moved to Q2. At Q2, job is again served in RR and receives 2 time units. If it still does not complete, it is preempted and moved to Q3. Run RR in Q3 with quantum size 4