Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the processor cycles for use on lower priority queues; some others implement priority aging whereby the priority of a process increases the longer it has been waiting. Discuss the relative advantages and disadvantages of these schedulers versus a preemptive priority scheduler where priorities are fixed, and the analysis of response time of a process need only consider processes at the same and higher priorities (assuming priority inversion is ignored), and where also a process can guarantee that no higher priority process can be pending when this process is executing (i.e. higher priority process execution is atomic with respect to this process.).