Process A is loaded to memory space from 1000 to 1004. Process B is loaded to memory space from 2000 to 2011. 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.