Q.1 In round-robin scheduling there are 'n' no. of processes in ready queue and time slice is 'q' units in worst case, the interrupted process will get the CPU again after
(a) (n-1)q units
(b) nq units
(c) (q-1)n units
(d) (q + 1)n units
(PLEASE Answer with Explanation if possible )