Priority inversion problem in processes: Say there are three processes in a system A, B and C. A is having the highest priority, B is having a medium priority and C is having the lowest priority. A and C both wish to access a task T however B has no intention of accessing T. since A was busy with other tasks, so C acquires the task T and starts running and enters in its critical region. Now, after some time A becomes free and has to wait for task T as C is accessing it. After some time, due to a result of an event another process B becomes active who has a medium priority. Now, Process C is blocked and Process B starts running. Here, a process with medium priority, Process B is running before a process with highest priority, Process A. This problem is known as priority inversion problem.