A$)$ For the following processes: assume non$-$preemptive scheduling, assume the processes

have arrived in the order $P1,P2,P3,P4,P5,$ all at time $0.$

Draw four Gantt charts that illustrate the execution of these processes using the following

scheduling algorithms: FCFS$,$ SJF$,$ nonpreemptive priority.

What is the turnaround time of each process for each of the scheduling algorithms in part $1?$

What is the average turnaround time of each process for each of the scheduling algorithms

in part $1?$

What is the waiting time of each process for each of these scheduling algorithms?

What is the average waiting time of each process for each of these scheduling algorithms.

Which of the algorithms results in the minimum average waiting time $($over all processes$)$

please make it correct and answer the question fully