luuent Name: 1. (100 points) Three processes P1, P2 and P3 with related information are given…

luuent Name: 1. (100 points) Three processes P1, P2 and P3 with related information are given in the following table: Process Burst Time (ms) Arrival Time (ms) P1 T 0 P2 30 20 P3 20 T is a positive integer (T>0). Please use a non-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 detailed steps. 30