Suppose n processes sharing a CPU using RR algorithm.
a)If each context switch takes s ms,determine the quantum size q such that the overhead resulting from process switching is minimized but,at the same time,each process is guaranteed to get its turn at the CPU at least once in every t ms.
b)If n=100,t=1,and s=0.001,what could be the size of q??what if s becomes 0.01?