Question 4 (1 point) Assume a Round Robin CPU scheduler with a quantum of three time units. Let sit: processes P1. P2. P3. P4. P5 and P6 have the following arrival times and CPU bursts: Assume that there is no other activity in the svstem at time t ii.e.. the ready queue is empty). Determine the schedule of process enecution. and compute the wait times and turnaround times for each of the six processes. Which of the following is TRUE about the wait times and turnaround times for the six processes? 0 P1 has the smallest turnaround time 0 P4 has the smallest wait time 0 P3 has the largest turnaround time 0 P4 has the smallest turnaround time