Write your own example with process set, arrive time and order, cpu burst time, etc; calculate each process's waiting time and average time for various algorithms on the example, considering preemptive and non-preemptive.

Given n processes with their burst times and arrival times, i am going to find the average waiting time and an average turn around time using FCFS scheduling algorithm. And secondly, considering preemptive and non-preemptive.

1. Completion Time: Time at which the process completes its execution.

2. Turn Around Time: Time Difference between completion time and arrival time. Turn Around Time = Completion Time - Arrival Time

3. Waiting Time(W.T): Time Difference between turn around time and burst time. Waiting Time = Turn Around Time - Burst Time.