In what sense can a process starve if the dispatcher always assigns time slices according to a priority system in which the priority of each process is fixed? $($Hint: What is the priority of the process that just completed its time slice in comparison to the processes that are waiting, and consequently which routine gets the next time slice?$)$ How, would you guess, do many operating systems avoid this problem?