2. Five batch jobs A through E, arrive at a computer center at almost same time. They have estimated running times of 10, 8, 4, 2, and 6. Their priorities are 3, 5, 2, 4 and 1 respectively with 5 being the highest priority. For each of the scheduling algorithms determine the average turnaround time and waiting time. ((5+5+5+5) [Unit 2: process management]
a. Round Robin (Quantum=2)
b. FCFS
c. Priority Scheduling
d. SJF