Q1. Assume three processes with estimated CPU bursts:

1. Assume that all three processes are ready for execution. Explain and calculate the benet of using short-process-next scheduling over just FIFO scheduling

2. Now, assume that p1 and p3 are ready for execution, but p2 becomes ready only after 3-time units. Explain what is necessary to still achieve an optimal execution order that minimizes the average turnaround time presuming the shortest remaining time first. What is the resulting execution schedule?