// SJF with arrival time #include #include struct process { int p,bt,at,tat,wt; }pro[10]; void sortat(); void sortbt(); int next(); void delprocess(int); int n,f,x=0,ttat=0,twt=0; void main() { clrscr(); int y=0; cout<<"\t::Program for SJF scheduling with Arrival Time::"; cout<<"\n--------------------------------------------------------------------\n\n"; cout<<"\nEnter the no. of Processes:"; cin>>n; f=n; for(int i=0;i>pro[i].bt; cout<<"\nEnter the Arrival Time of Process"<>pro[i].at; } sortat(); cout<<"\n\n------------------------------------------------------------------------------\n"; cout<<"Process | Burst Time | Arrival Time | TurnAroundTime | Witing Time |\n"; cout<<"------------------------------------------------------------------------------\n"; while(n!=0) { x+=pro[y].bt; pro[y].tat=x-pro[y].at; pro[y].wt=pro[y].tat-pro[y].bt; twt+=pro[y].wt; ttat+=pro[y].tat; cout<<" P"<