Consider the following preemptive priority-scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for the CPU (in the ready queue but not running), its priority changes at a rate _; when it is running, its priority changes at a rate _. All processes are given a priority of 0 when they enter the ready queue. The parameters _ and _ can be set to give many different scheduling algorithms.
a. What is the algorithm that results from _ >_>0?
b. What is the algorithm that results from _ < _ <0?