Let's assume we are to implement a Round-Robin algorithm. What will happen in a case when a process has completed it's time quantum at the same time as another process arrives. Let's say we have a time quantum of 3 CPU cycles and a process A's burst time is 5 CPU cycles. If it runs from 0 to 3 (in CPU cycle time), and another process B also arrives at time 3 (in CPU cycle time), which process goes to the ready queue first? Is it possible for the process A to run 2 consecutive time quanta if the next process arrives at the same time as it completes it's first time quantum? This is one of those edge cases and it's very hard to find an explained example on the Internet. Thanks.