4. This question is about scheduling tasks on the CPU in an operating system. For this problem we'll use task switching instead of batch processing. Task switching ans once each task is scheduled, it has a time limit. After 4 units of time, it must give up the CPU to allow the next task to run. Tasks are just chosen in the order n. Once the time limit is reached, if there is more work to be done, the task give must go to the end of the queue. This is called round-robin scheduling. Compute a round-robin schedule for the following tasks. Draw the timeline, and calculate the average turnaround time. Remember, the time limit is 4 units. Job Time JI J2 J3 J4 4