Consider a 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 the rate A. When it is running, its priority changes at a rate B. All processes are given a priority of 0 when they enter the ready queue. The parameters A and B can be set to give many different scheduling algorithms.
a. What is the algorithm that results from B> A > 0?
b. What is the algorithm that results from A < B< 0?