Problem 1: Competing Claims Assume there are three processes (P1, P2, P3) in the system, competing for four resources: (MONITOR, NETWORK, PRINTER, USB). Each resource is protected by a semaphore that ensures mutually exclusive access to the resource (ie: a process must call USB.Wait() before using USB). The programs are as follows: a) Show, using a resource allocation graph (or by other convincing arguments) that this system contains within it the possibility of deadlock. b) Suggest a way to re-order the code that ensures there will not be deadlock, but preserves the necessary mutual exclusion