Deadlock based problem in operating system# Deadlock usually occurs between a known set of processes that end up waiting on each other. If we cannot prevent or avoid deadlock, another common approach is to let the processes run, and detect deadlock if it occurs. This can even be a useful programming paradigm: the group of processes deadlock waiting for input whenever there is no more work for them to do. One of the ways to detect deadlock on a uni-processor is to have the contending processes run at a particular pre-emptive priority level: a lower priority process will only run when no process at the higher level is ready to run. Describe an application where this might be an appropriate software architecture.