Please answer based on Unix environment for Operating System .

Use the formula : turnaround time per process = Completion time - arrival time waiting time = turnaround time - burst time The process arrival time chart given below: Process Arrival time Burst Time Pi 0 16 P2 0 10 P3 6 P4 7 6 P5 8 10 Draw a Gantt chart to illustrate how these processes would be scheduled using Round Robin (RR) and First-come First-Served (FCS) scheduling, and calculate the waiting time for each process. If when choosing a process to schedule next you could legally choose any of a number of processes, choose the one with the lowest- numbered name; i.e., choose pi over pi if