单选题：Suppose there are three processes P1,P2,P3 and their arriving ti

Suppose there are three processes P1,P2,P3 and their arriving time and executing time are in following table：
```
Process Arriving Time Executing Time
P1 8:00 2 hours
P2 8:45 1 hour
P3 9:30 0.25 hour
```
They run on a CPU one by one. If Shortest-Job-First(SJF) scheduling algorithm (non-preemptive) is adopted, then these processes will run in following order ______。@[C](1)
A. P3，P2，P1
B. P1，P2，P3
C. P1，P3，P2
D. P3，P1，P2





A.P3，P2，P1
B.P1，P2，P3
C.P1，P3，P2
D.P3，P1，P2


答案：C