$4$ Imagine a situation wherein the processor adopts the Round$-$Robin process scheduling algorithm. Under such circumstances, if there are $\text{'}n\text{'}$

processes in the ready queue and the time quantum allotted to each process is $\text{'}q\text{'},$ then each process must wait no longer than

time units until its next time quantum.

$5$ Imagine a hypothetical situation wherein we have a single$-$core, uniprocessor system that does not leave the CPU idle. At any given time, the

number of processes that can be in the running state in this system is

$.$

A $,0$

B $,1$

C $,2$

D

$3$