Consider the following set of processes, with length of the CPU burst given in milliseconds.

Process Burst Time Priority

P1 125 3

P2 62 1

P3 45 2

P4 113 4

Assume all processes arrived at time 0 and burst times are in milliseconds.

Draw the Gantt charts for the following scheduling algorithms: non-preemptive Priority where the lowest number is the highest priority and SJF.

Calculate the average throughput and turnaround time for these scenarios.