Q27

Consider a single processor system with four processes $\text{A, B, C,}$ and $\text{D}$, represented as given below, where for each process the first value is its arrival time, and the second value is its $\text{CPU}$ burst time. $\mathrm{A}(0,10), \mathrm{B}(2,6), \mathrm{C}(4,3)$, and $\mathrm{D}(6,7)$. Which one of the following options gives the average waiting times when preemptive Shortest Remaining Time First $\text{(SRTF)}$ and Non-Preemptive Shortest Job First $\text{(NP-SJF)}$ $\text{CPU}$ scheduling algorithms are applied to the processes?