4.
Consider the following set of processes, with the length of CPU burst time given in milliseconds. Processes CPU Burst Priority A 8 3 B 13 1(Lowest) C 19 2 D 3 4(Highest) The processed are assumed to have arrived in the order A, B, C and D all at time 0. What is the turnaround time and waiting time for the scheduling algorithms, RR(quantum = 5) and Priority Algorithm
$\begin{array}{|c|c|c|}\hline \text{Processes} & \text{CPU Burst} & \text{Priority} \\ \hline A & 8 & 3 \\ B & 13 & 1\,(\text{Lowest}) \\ C & 19 & 2 \\ D & 3 & 4\,(\text{Highest}) \\ \hline \end{array}$
[5]