Please write a complete solution showing technical details (dynamic ready queue and dynamic CPU for each step) to gradually generate relevant Gantt charts and get a correct and complete solution perfectly.

make a gantt chart with the following cases

1. 0

2. 10

3. 20

and last case T > 30

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