Consider the following set of processes, with the priority values, the length of the CPU$-$burst times and arrival times provided in the table below.

$\backslash$table$[[,\backslash$table$[[$Priori$],[$ty$]],\backslash$table$[[$Arrival$],[$Time$]],\backslash$table$[[$CPU Burst$],[$Time$]]],[$P$,4,0,10],[$A$,,,],[$P$,3,3,6],[$B$,3,,],[$P$,1,7,3],[$C$,,,],[$P$,2,11,4],[$D$,,,]]$

Draw the Gantt charts that illustrate the execution of these processes using the following non$-$preemptive scheduling algorithms: FCFS$,$ SJF$,$ non$-$preemptive priority $($a lower priority value indicates a higher relative priority$).$

What is the turnaround time of each process for each of the scheduling algorithms in Part a$.$

What is the waiting time of each process for each of the scheduling algorithms in Part a$?$

What is the average waiting time of these processes for each of the scheduling algorithms in Part a$?$