Answer the following using the processes and their corresponding arrival time and burst time.

These processes are being scheduled using a preemptive, round-robin scheduling algorithm with a time quantum of 2 units.

PID	Arrival Time	Burst Time
P1	0	4
P2	1	5
P3	2	3
P4	3	2
P5	4	6

1. Use a Gantt chart to represent the above processes (5 points)

2. Calculate the average waiting time for each process (5 points)

3. Calculate the completion time for each process (5 points)

4. Calculate the turn around time for each process (5 points)