Three processes P1, P2, and P3 with related information are given in the following table: Process Burst Time (ms) Arrival Time(ms) P1 50 0 P2 T 20 P3 10 30 T is a positive integer (T>0). If you use a preemptive shortest job first scheduling algorithm to schedule the three processes, make a Gantt chart, and calculate the different waiting times of the three processes. Please show a professional perfect solution with the necessary details

.

1. Undergraduate Student ( 100 points) Three processes P1,P2 and P3 with related information are given in the following table: T is a positive integer (T>0). If you use a preemptive shortest job first scheduling algorithm to schedule the three processes, make a Gantt chart, and calculate different waiting times of three processes. Please show a professional perfect solution with necessary details. 2. Graduate Student ( 100 points) Three processes P1,P2 and P3 with related information are given in the following table (Note: The larger a priority number, the higher the priority). T is a positive integer (T>0)