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	30	15
P3	T	25

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.