Please do it all and draw the Gant chart for all

Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: The processes are assumed to have arrived in the order P1,P2,P3,P4,P5, all at time 0. using FCFS, SJF, a non pre-emptive, and RR (quantum = 1) scheduling. a) What is the turnaround time of each process for each of the scheduling algorithms? b) What is the waiting time of each process for each of the scheduling algorithms? c) Which of the schedules results in the minimal average waiting time (over all processes)