5. For the processes shown below, with their arrival times and CPU burst lengths, give the schedule of these processes if the algorithm used is Shortest-remaining-time-first. (You can use the format (t1, 12] Pi means process Pi is scheduled from time t1 to time 12. For example, [0, 2] P1, [2, 5) P2, [5, 6] P3 means P1 is scheduled from time 0 to 2, P2 is scheduled from time 2 to 5, and P3 is scheduled for time 5 to 6.) Process Arrival Time Burst Time 9 P, 8 P, 4 6. P. 3 6 1 2. 5. P.