Can I get help with CPU scheduling?

5.12 Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process P1 Priorit Burst Time 10 P3 PM P5 The processes are assumed to have arrived in the order P1, P2, P3, P4, Ps, all at time 0 a. Draw four Gantt charts illustrating the execution of these pro- cesses using FCPS, SJF, a nonpreemptive priority (a smaller pri ority number implies a higher priority), and RR (quantum 1) b. What is the turnaround time of each process for each of the c. What is the waiting time of each process for each of the scheduling d. Which of the schedules in part a results in the minimal average scheduling scheduling algorithms in part a? algorithms in part a? waiting time (over all processes)? 5.13 Which of the following scheduling algorithms could result in starvation? a. First-come, first-served b. Shortest job first c. Round robin d. Priority