1. (100 points) Four processes P1, P2, P3 and P4 with related information are given in the following table:

Burst Time (ms) Arrival Time (ms)

Process

P1

T

P2

40

P3

20

P4

10

T is a positive integer (T>0). Please use a nonpreemptive 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.

0

30

60

80