Consider a preemptive priority scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting in the ready queue, its priority increases at a rate $.$ When it is running, its priority increases at a rate $.$ Both and are greater than $0.$ All processes are given a priority of $0$ when they enter the ready queue. The parameters and can be set to design many different scheduling algorithms. $($a$)$ What are the implications of $<$ $?$ What scheduling algorithm does this scenario mimic? $($b$)$ What are the implications of $<$ $?$ What scheduling algorithm does this scenario mimic?