The following table lists arrival times and CPU burst lengths for four processes: Arrival Time 0 Process IPO P1 P2 P3 3 5 9 Burst length 10 8 3 6 Simulate (on paper) the application of the preemptive shortest job first (PSJF) scheduling policy 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 =