(2) Five batch jobs A to E arrive at same time. They have estimated running times 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively with 5 being highest priority. For each of the following algorithm determine mean process turnaround time. Ignore process swapping overhead. Round Robin, Priority Scheduling, FCFS, SJF. Process A B C D E Running Time Time required for completion (AT) 10 6 2 4 8 Priority 3 5 2 1 4