Process Scheduling: The notation $($P$,$ y$,$ z$)$ means that process P arrives at time y and needs z time units of processing time. Assume a scheduler observes the following arrivals:$($A$,0,10)$; $($B$,1,12),($C$,3,4),($D$,3,3)$Assume the context switch to a different process is $0$ time unit. Provide the turnaround time for each process. Assume the scheduler implements a multilevel queue system with the following restrictions: there are three queues: processes enter the system in the high$-$priority queue and they are served in round robin fashion $($time slice $=2)$ while there for only one time slice and then moved to the nextqueue which is served using SRTF $($preemptive$).$ The scheduler also distributes the time as follows between the two queues: $6$ time units for the highest priority queue and $2$ tire units for the lowest priority queue starting with the highest priority queue at time $0,$ if there are no jobs in one queue the scheduler switches to the next queue right away.