Assume a system with four resource types, C = < 7, 9, 6, 6...
Assume a system with four resource types, C = < 7, 9, 6, 6 > (this is the total number of resources in the system, andnot what is currently available), and the maximum claim table shown below: Process R0 R1 R2 R3 P0 6 9 0 1 P1 3 4 4 3 P2 2 7 4 2 P3 6 3 4 5 P4 1 2 2 1 The resource allocator is considering allocating resources according to the following table: Process R0 R1 R2 R3 P0 0 2 0 0 P1 2 2 2 2 P2 2 3 0 1 P3 2 0 2 2 P4 1 2 1 1 Run the avoidance algorithm on this system to determine if this state is safe. If it is safe, give the sequence in which processes can be run. If it is unsafe, enumerate the processes that could in the future get involved in a deadlock.Show your steps from the algorithm (amount of resources free after each step). You will need to calculate the available resources and the maximum needs in the future for each process.