Given $5$ processes waiting in the ready quece $($ with burst$-$time data$)$ use the First$-$Come$-$First$-$Schedule algorithn to decide the scheduling order, and calculate two criteria of each process: walting time, tumaround time

Here is the incomplete C program

finish this program to implement the FCFS algorithm, with processes' id stored in array id$\_$order; finish this program to calculate the waiting time of each process, with results stored in array waiting$\_$time; finish this program to calculate the turnarourid time of each process, with results stored in array turnaround$\_$time;$//$task $1$: to decide the scheduled process order with FCFS$,$ wit$$ results stored in id$\_$order$[]$printf$("$

Process order with FCFS:

$")$;$//$task $2$: to calculate each process' waiting time, with results stored in waiting$\_$time$[]$ printfi." $"$n waiting time:

$")//$task $3$: to calculate each process' turnaround time, with results stored in waiting$\_$timo$[]$ printf$("$

turnaround time:

$")$return $0$ ;$\}$