3. Assume that (1) A process can continue execution for a maximum of 6 instruction cycles; (2) the addresses of the dispatcher: 100 - 105. Simulate the execution of the following three processes. 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. If there is any idle time on CPU, please clearly indicate the idle time in your answer. 4000 4001 4002 4003 4004 Process A 5000 5001 5002 5003 5004 5005 5006 Process B 3. Assume that (1) A process can continue execution for a maximum of 6 instruction cycles; (2) the addresses of the dispatcher: 100 - 105. Simulate the execution of the following three processes. 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. If there is any idle time on CPU, please clearly indicate the idle time in your answer. 4000 4001 4002 4003 4004 Process A 5000 5001 5002 5003 5004 5005 5006 Process B