(十) Consider this set of process pi, where P={p1, p2, p3, p4}, as show in Table 1.The processes are assumed to have arrived in the order p1, p2, p3, p4. What isthe average waiting time for preemptive SJF (shortest job first) algorithm?
(A) 9
(B)7
(C) 11.25
(D) 11.5