Suppose a system uses a (preemptive) multi-level feedback queue scheduler to decide when threads get access to a single core. This scheduler divides threads into five priorities: priority 4 (highest), with a time slice of 1 millisecond priority 3, with a time slice of 2 milliseconds priority 2, with a time slice of 5 milliseconds priority 1, with a time slice of 10 milliseconds priority 0, with a time slice of 20 milliseconds And the scheduler increases the priority of threads (if possible) whenever they are not preempted and do not use their entire time slice and decreases the priority of a thread whenever it uses its entire time slice and still requires more computation. This system is running four threads, each of which have the following CPU usage patterns which are repeated indefinitely: thread A attempts to perform computation indefinitely thread B1 attempts to perform 1.5 milliseconds of computation to process mouse input every 20 to 30 milliseconds thread B2 attempts to perform 1.3 milliseconds of computation to process mouse input every 20 to 30 milliseconds thread C attempts to perform 8.5 milliseconds of computation, followed by waiting about 50 milliseconds to get data from the network For the following questions, assume context switch and other scheduling overheads are neglibile and all threads have been running for a while. Question 4 (1 points): (see above) Thread B1 will have priority A. OO B. O 1 or 0 C. O 1 D. 1 or 2 E. O 2 F. O 2 or 3 G. 3 H. O 3 or 4 I. O 4 J. O none of the above Suppose a system uses a (preemptive) multi-level feedback queue scheduler to decide when threads get access to a single core. This scheduler divides threads into five priorities: priority 4 (highest), with a time slice of 1 millisecond priority 3, with a time slice of 2 milliseconds priority 2, with a time slice of 5 milliseconds priority 1, with a time slice of 10 milliseconds priority 0, with a time slice of 20 milliseconds And the scheduler increases the priority of threads (if possible) whenever they are not preempted and do not use their entire time slice and decreases the priority of a thread whenever it uses its entire time slice and still requires more computation. This system is running four threads, each of which have the following CPU usage patterns which are repeated indefinitely: thread A attempts to perform computation indefinitely thread B1 attempts to perform 1.5 milliseconds of computation to process mouse input every 20 to 30 milliseconds thread B2 attempts to perform 1.3 milliseconds of computation to process mouse input every 20 to 30 milliseconds thread C attempts to perform 8.5 milliseconds of computation, followed by waiting about 50 milliseconds to get data from the network For the following questions, assume context switch and other scheduling overheads are neglibile and all threads have been running for a while. Question 4 (1 points): (see above) Thread B1 will have priority A. OO B. O 1 or 0 C. O 1 D. 1 or 2 E. O 2 F. O 2 or 3 G. 3 H. O 3 or 4 I. O 4 J. O none of the above