2. (25 points ) Five batch jobs A throngh E arrive at a computer center in the order A to E at almost the saane 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 tlhe mean process waiting time. Ignore process switching overhead. Draw Gnatt charts to show your steps. 1 ) (a) Round Robin (assume quautum (b) Priority scheduling (c) First-come first-served (d) Shortest job first For (a), assime that the system is nultitasking, and that ench job gets its fnir share of the CPU: job B, which has the highest priority is started first. For (b) through (d) assume that only one jolb at a time runs, until it finishes. All jols are completely CPU bound. is mul