3. Assume that (1) A process can continue execution for a maximum of 6 instruction cycles; (2) the addresses of the dispatcher: 100105. Simulate the execution of the following three processes. Round robin policy is used to schedule processes. In the beginning, A,B,C is the order in the ready queue, i.e., A is in the first position in the queue. If there is any idle time on CPU, please clearly indicate the idle time in your answer. (4 points)