A variation of preemptive priority scheduling has dynamically changing priorities. A new process is assigned a priority 0. While a process is in the ready queue, its priority changes at the rate of a; and while it is executing, its priority changes at the rate of b. The different values of a and b give different algorithms. If larger values imply higher priorities, state with reasons the type of algorithm that will result if:

a. α < β < 0

b. β > α > 0