Is the following graph contain Deadlock? If yes, show how the deadlock can be resolved. TI T: RA R2 R3 T2 Suppose there are three processes P1, P2 and P3. P1 requires 6 resources, P2 requires 8 resources P3 requires 2 resources. What are the minimum no. of resources required so that system will never enter in deadlock? Suppose each process needs 4 units of resources and total no. of resources are 52. What are the maximum no. of process should run in safe state