Consider the following set of processes, with the length of theCPU burst given in milliseconds:Process Burst Time PriorityP1 10 3P2 1 1P3 2 3P4 1 4P5 5 2The 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 thefollowing scheduling algorithms: FCFS, SJF, nonpreemptive priority (a smallerpriority number implies a higher priority), and RR (quantum = 1).b. What is the turnaround time of each process for each of the scheduling algorithms inpart a?c. What is the waiting time of each process for each of the scheduling algorithms?d. Which of the algorithms results in the minimal average waiting time (over allprocesses)?