Please complete these questions in handwriting

Part 1 Assume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 7 P2 5 P3 15 P4 11 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a time quantum of 4 ms (Total Wait and Response Times) Part II Now assume that P1 arrives in the ready queue at time 0, P2 arrives at time 4, P3 arrives at time 10, and P4 arrives at time 15. The CPU execution times for the processes are the same as in Part I: Process Execution Time P1 7 P2 15 5 P3 P4 11 Draw the Gantt chart and calculate the total wait time for each of the following scheduling algorithms: 1. Shortest Job First 2. Shortest Remaining Time Next (remember, this is a preemptive algorithm) 3. Preemptive priority with the following priorities: Process Priority P1 4 P2 2 3 P3 P4 1 For this system, assume that the highest priority has the lowest number (i.e., 1 is the most important) 4. Non-Preemptive priority with the same priorities as above. 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