Consider the following three processes that arrive in a system at the specified times, along with the duration of their CPU bursts. Calculate the completion time of the three processes, the average turnaround time (tt), and the average response time (rt) under each of the following scheduling policies. Scheduler: First Come First Serve The completion time of P1 is The completion time of P2 is The completion time of P3 is The average turnaround time is . Note: An equation like (tt1+tt2+tt3)/3 is exactly what wanted and in the sequence of TT for P1, P2 and then P3! The average response time is . Note: An equation like (rt1+rt2+rt3)/3 is exactly what wanted and in the sequence of RT for P1,P2, and then P3 ! Scheduler: Shortest Job First (non-preemptive) The completion time of P1 is The completion time of P2 is The completion time of P3 is The average turnaround time is Note: An equation like (tt1+tt2+tt3)/3 is exactly what wanted and in the sequence of TT for P1,P2 and then P3 ! The average response time is . Note: An equation like (rr1+rt2+rt3)/3 is exactl what wanted and in the sequence of RT for P1,P2 and then P3! Scheduler: Shortest Remaining Time First (preemptive) The completion time of P1 is The completion time of P2 is The completion time of P3 is The average turnaround time is Note: An equation like (tt1+tt2+tt3)/3 is exactly what wanted and in the sequence of TT for P1,P2 and then P3! The average response time is . Note: An equation like (rt1+rt2+rt3)/3 is exactly what wanted and in the sequence of RT for P1,P2 and then P3 ! Scheduler: Round robin with a time slice of 3 The completion time of P1 is The completion time of P2 is The completion time of P3 is The average turnaround time is . Note: An equation like (tt1+tt2+tt3)/3 is exactly what wanted and in the sequence of TT for P1,P2 and then P3 ! The average response time is . Note: An equation like (rr1+rt2+rt3)/3 is exactly what wanted and in the sequence of RT for P1, P2 and then P3