Consider the following processes with cpu burst and arrival time. Now execute the following:

$\backslash$table$[[$Process Queue,Burst time,Arrival time$],[$P$1,6,2],[$P$2,2,5],[$P$3,8,1],[$P$4,3,0],[$P$5,4,4]]$

Draw a Gantt chart illustrating the execution of these processes using the SJF non$-$Preemtive scheduling algorithm.

What is the average process turnaround time?

What is the average process waiting time?

Also Show the C programming code with the output