Problem 2: Competing Claims Assume there are three processes in the system, competing for four resources (R1, R2, R3, R4). Each one is protected by a semaphore. 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