The ready queue has just received these processes: P1, P2, P3, P4. The CPU execution times for these processes are as follows: Process Execution Times: P1:9 ,P2: 8, P3: 20, P4: 7. P1 arrives in the ready queue at time 0, P2 arrives at time 4, P3 arrives at time 11, and P4 arrives at time 14.

Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms:

1. Shortest Job First (Total Wait Time)

2. Shortest Remaining Time Next (Total Wait Time) Remember, this is a preemptive algorithm

3. Round Robin, with a time quantum of 6 (Total Wait and Response Times)

4. Preemptive priority with the following priorities (Total Wait Time): Process Priority P1 4 P2 2 P3 3 P4 1 For this system, assume that the highest priority has the lowest number (i.e., 1 is the most important)

5. Non-Preemptive priority with the same priorities as above (Total Wait Time). Be sure to note priority inversion when/if it occurs. Priority inversion is when a process with a lower priority executes over a process with a higher priority.