The following table lists arrival times and CPU burst lengths for four processes: Process Arrival Time Burst length PO 0 10 P1 3 8 P2 5 3 P3 9 6 Simulate on paper) the application of the round-robin (RR) scheduling policy, using a quantum of 2, to the processes described in the table, then answer the following questions. Ignore context switch times. At what time tick is each process first allowed to run on the CPU? PO = P1 = P2 = P3 = What are the total wait times for each process? PO = P1 = P2 = P3 =