1. #include <stdio.h>
2. void findwaitingTime(int processes[], int n, int bt[], int wt[], int at[]){
3. int service_time[n];
4. service_time[0] =0;
5. wt[0]=0;
6. for(inti=1;i<n;i++)
7. {// Calculate service time for each processservice_time[i]= service_time[1-1]+bt[i-1];
8. // Calculate waiting time for each process
9. wt[1] = service_time[i] - at[i];
10. // If waiting time for a process is negative, make it zeroif(wt[i]<0)
11. wt[i]=0;
12. {
13. void findTurnAroundTime(int processes[], int n, int bt[], int wt[],int tat[]){for(int i=0;i<n; i++)nti=0;i<n;i++){tat[i]=bt[i]+wt[i];{{
14. void findAvgTime(int processes[], int n, int bt[], int at[]){
15. int wt[n], tat[n],total_wt=0,total_tat=0;
16. findwaitingTime(processes, n,bt,wt,at);
17. findTurnAroundTime(processes,n, bt, wt,tat);
18. printf("Process Arrival Time Burst Time Waiting TimeTurn-AroundTime\n");
19. for (int i -0;i<n;i++)total_wt+-wt[1];total_tat +=tat[i];printf("%d%d%d%dど:
20. i+1,at[i],bt[i],wt[i],tat[i]);}
21. float avg_wt=(float)total_wt / n;float avg_tat =(float)total_tat/n;printf("\nAverage Waiting Time:%.2f",avg_wt);printf("\nAverage Turn-Around Time: %.2f\n",avg_tat);
22. )
23. int main()
24. {
25. int processes[]-{1,2,3);int n = sizeof(processes) / sizeof(processes[θ]);int burst_time[]={10,5,8};int arrival_time[]={0,1,2};findAvgTime(processes, n, burst_time,arrival_time);return 0;