For problems 1 and 2, a computer has the following four processes that have arrived in the ready queue in the sequence shown below. NOTE: There are no mandatory time outs required.

• Process 1 with a run time of 40 seconds, a priority of 1, and it will require 20 seconds of I/O after 20 seconds of execution.

• Process 2 with a run time of 15 seconds and a priority of 2.

• Process 3 with a run time of 25 seconds, a priority of 2, and it will require 15 seconds of I/O after 5 seconds of execution.

• Process 4 with a run time of 10 seconds and a priority of 1.

(HINT: Review Module 6 section 2.1.2 for the definitions of these scheduling algorithms and Self-Assessment problems 1-4.)

1. If the Round Robin Scheduling algorithm is used, which process completes first and why?

2. If the Non-preemptive Priority Scheduling algorithm is used, which process completes second and why?