#define N $4$int main$()\{$ static int pn$[$N$]=\{3,2,1,4\},$ at$[$N$]=\{3,2,0,1\},$ bt$[$N$]=\{25,5,10,15\}$;$$ int wt$[$N$],$ tt$[$N$],$ i$,$ j$,$ sum $=0$;$$ float avgwt $=0\mathrm{.}0,$ avgtt $=0\mathrm{.}0$;$$ printf$("\backslash$tFCFS Scheduling Policy

$")$;$$ printf$("------------------------------------------------------------$

$")$;$$ printf$("|$ pn$\backslash$t$|$ at$\backslash$t$|$ bt$\backslash$t$|$ wt$\backslash$t$|$ tt$\backslash$t$|$

$")$;$$ printf$("------------------------------------------------------------$

$")$;$//$ Calculate waiting time$$ wt$[0]=0$; $//$ First process has zero waiting time$$ for $($i $=1$; i $<$ N; i$++)\{$ wt$[$i$]=0$;$$ for $($j $=0$; j $<$ i; j$++)\{$ wt$[$i$]+=$ bt$[$j$]$;$\}$ wt$[$i$]-=$ at$[$i$]$;$$ if $($wt$[$i$]<0)$ wt$[$i$]=0$;$//$ No negative waiting time$\}//$ Calculate turnaround time and sum of waiting$/$turnaround times$$ for $($i $=0$; i $<$ N; i$++)\{$ tt$[$i$]=$ bt$[$i$]+$ wt$[$i$]$;$$ avgwt $+=$ wt$[$i$]$;$$ avgtt $+=$ tt$[$i$]$;$$ printf$("|\%$d$\backslash$t$|\%$d$\backslash$t$|\%$d$\backslash$t$|\%$d$\backslash$t$|\%$d$\backslash$t$|$

$",$ pn$[$i$],$ at$[$i$],$ bt$[$i$],$ wt$[$i$],$ tt$[$i$])$;$\}$ printf$("------------------------------------------------------------$

$")$;$//$ Calculate and display average waiting time and turnaround time$$ avgwt $/=$ N;$$ avgtt $/=$ N;$$ printf$("$Average Waiting Time: $\%\mathrm{.}2$f

$",$ avgwt$)$;$$ printf$("$Average Turnaround Time: $\%\mathrm{.}2$f

$",$ avgtt$)$;$$ return $0$;$\}$ do it with Gantt chart