Process A is loaded to memory space from 5000 to 5004. Process B is loaded to memory space from 6000 to 6011. Round robin policy is used to schedule processes A and B. In the beginning, Process A is in the first position in the ready queue.

In order to prevent monopolizing, we assume OS only allows a process to continue execution for a maximum of 6 instruction cycles. The dispatcher is in the memory from 100 to 105. Simulate the execution. (6 points).