Can the priority inversion problem outlined below occur if user-level threads are used instead of kernel-level threads? Explain your answer.

One issue with priority scheduling is "priority inversion". Consider high, medium, and low priority threads H, M, and L, respectively.

If H needs to wait for L (because, for example, L holds a lock H would like to acquire), and M is on the ready list, then H will not get the CPU because the low priority thread L will never get scheduled ahead of M.