Consider a system with four processes P1, P2, P3, and P4, and two resources, R1, and R2, respectively. Each resource has two instances. Furthermore: - P1 allocates an instance of R2, and requests an instance of R1: P2 allocates an instance of R1, and doesn't need any other resource; P3 allocates an instance of R1 and requires an instance of R2; P4 allocates an instance of R2, and doesn't need any other resource. If you draw the resource allocation graph: a) Is there a cycle in the graph? If yes name it. (example: P1, P2, P3,P4) b) If there is a cycle, examine if the system is deadlocked or not? explain your answer. A process can be swapped temporarily out of memory to a backing store, and then brought back into memory for continued execution 1. This always can happen without problems (true/False). 2. If the previous statement is false and a major problem can happen what is this problem and as an OS designer, suggest 2 solutions