Exercise 1. (20%) Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 11. 6, 2, 4, and 8 minutes. Their priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine tl context switching overhead. the average process tu . Round-Robin with time quantum -1 minute Priority scheduling First come, first served (run in order 11, 6, 2, 4, 8) Shortest job first For Round-Robin scheduling, assume that the system is multiprogrammed, and that each job gets its fair share of the CPU. For other scheduling algorithms, assume that only one job runs at a time, until it finishes. All jobs are completely CPU bound