Consider a system with tour processes (P1, ..., P4) and tour Resource Types (R1, R2, R3, R4) with: The resource allocations: P1(1, 0, 1, 0), P2(0, 1, 0, 1), P3(2, 1, 0, 1), and P4(1, 1, 1, 1) The maximum resource a process can request: P1(3, 2, 1, 2), P2(2, 3, 2, 2), P3(4, 1, 2, 1), and P4(3, 1, 2, 1) Available = (2, 1, 1, 2) Compute the total number of resources in the system Compute the resources still needed by each process Is the system in a safe state? Assume that process P4 performs a request (1, 1, 1, 1). Can this request be granted and keep the system in a safe state