A system adopts a round-robin scheduling approach, where every process gets 6ms of execution time. Assume the dispatcher takes 2ms for a process switch. In a recorded timespan, the system has four processes P1, P2, P3 and P4, none of which perform any I/O. They are shown in the following table:

1) Draw a timing diagram that includes all processes including the dispatcher. You may assume that the rst process that runs has already been dispatched. Indicate the status of each process at every change.

2) Find the turnaround time for each process.

Table:

Processor ID	Arival time in ms	Total CPU time in ms:
P1	6	20
P2	0	16
P3	12	8
P4	18	10