Five batch jobs A through E arrive at a computer center in the order A to E at almost the same time. They have estimated running times of 7, 5, 1, 2, and 6 minutes. Their (externally determined) priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the mean process waiting time. Ignore process switching overhead. Draw Gnatt charts to show your steps. (a) Round Robin (assume quantum = 1) (b) Priority scheduling (c) First-come first-served (d) Shortest job first For (a), assume that the system is multitasking, and that each job gets its fair share of the CPU; job B, which has the highest priority is started first. For (b) through (d) assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound