tiw

Q$4.$ Consider $4$ processes $D,Q,R,S$ scheduled on a CPU as per RR algonithon with $TQ=4$ units. Processer anive in order $P,Q,R,S$ all at time $t=0.$ There is exactly one contersswitch from & to $Q,$ exactly one context suitch from $R$ to $Q$ and exactly two content switches from $Q$ to $R.$ There is no context switch from & to $P.$ Suitching to a ready process affer temmation of another process is also Considered a contere suitch.