Only Answer question B. What is the turn around time of each process for each of the scheduling algorithm in part a(fcfs,sjf...etc)

Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1 7 5 P2 2 4 P3 11 3 P4 9 1 P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 2). FCFS: Enter the order of the processes FCFS : P1 P3 PS 10 11 12 13 14 15 16 17 18 23 24 27 28 29 30 31 32 33 34 SJF p3 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 Non preemptive prioirty PS P1 14 15 16 17 18 19 20 21 27 20 31 RR ( Round robin with quanta 2) P3 PS PI 13 P3 1423 11 12 13 14 15 16 17 18 19 20 21 22 23 25 20 20 11 b. What is the turnaround time of each process for each of the scheduling algorithms in part a? X FCFS SJE PRI RR P1 P2 P3 P4 PS