Solve the following examples using FCFS, SJF and SJF Preemptive algorithms and do the following:

• Draw the timeline (Gant chart) for each process
• Calculate the waiting time of each process
• Calculate the average waiting time
• Calculate each Process Turn-around Time
• Average Turn-around Time

Example 1: Process Queue Burst time Arrival time P1 6 2 P2 2 5 P3 1 8 3 P4 0 P5 4 4 Example 2: Process Queue Burst time Arrival time P1 4 0 P2 2 2 4 P3 3 N P4 4 5 P5 8 4 P6 5 Example 3: Process Queue Burst time Arrival time P1 8 P2 5 0 P3 9 4 P4 2 1 P5 4 7 PG 6 4