Simulate a $2$ CPU processor scheduling system using load sharing. In load sharing, processes are not assigned to a particular processor, but are dispatched to the next available processor. Simulate a shared global round robin queue with a time quantum of $3$ time steps preemption. Indicate, for each box, which process is executing on which processor $($NOTE: processors can be idle, in which case a time box can be empty$).$ The process arrival and service times to simulate are: Process Arrival Time Service Time A $04$ B $15$ C $15$ D $47$ E $65$ F $84$ To resolve ambiguities: $$ If CPU$1$ and CPU$2$ are both available at same time, CPU$1$ selects next process first from global RR queue. $$ As in our text book, if a process is preempted at the same time that a process arrives, the arriving process is placed on the RR queue tail first, followed by the preempted processes. CPU$1$ CPU$2$ T $012345678910111213141516$