(100 points) Three processes P1, P2 and P3 with related information are given in the following table: Burst Time (ms) Ar
Posted: Sun Jul 10, 2022 11:27 am
(100 points) Three processes P1, P2 and P3 with related information are given in the following table: Burst Time (ms) Arrival Time (ms) 50 T Process PI 0 P2 30 P3 40 60 T is a positive integer (T>0). Please use a preemptive shortest job first scheduling algorithm to make Gantt charts, and calculate different waiting times of three processes for different cases. Please write a professional perfect solution with sufficient details.