QUESTION 3 Process P1 has a low priority of 100, and processes P2, P3, and P4 all have a high priority of 0 (lower number means higher priority). P1 holds resource R and P2 waits for this resource. Processes P3 and P4 never get blocked. All four processes intend to run forever (say, with a while(1) loop). All processes are scheduled using a round-robin scheduler and are not subject to aging. Which processes will never have a chance to use the CPU? O Only P1. P1, P2, and either P3 or P4. O Only P2 O P1 and P2. QUESTION 4 What is the relationship between time quantum duration in preemptive round-robin scheduling and application response time? OLonger quantum increases response time. The two variables are unrelated. Longer quantum decreases response time