Consider a computer with two processes, H, with high priority, and L, with low priority. The scheduling rules are such that H is run whenever it is in ready state. At a certain moment, with L in its critical region, H becomes ready to run (e.g., an I/O operation completes). H now begins busy waiting, but since L is never scheduled with H is running, L never gets the chance to leave its critical region, so H loops forever. This situation is sometimes referred to as the priority | inversion problem. If instead of priority scheduling, we use round-robin scheduling. Will we encounter the same problem? Please explain your answer in detail