A computer system contains 4 types of resources - R1, R2, R3 and R4. A total of 16 instances of R1, 12 instances of R2, 13 instances of R3 and 9 instances of R4 are present in the system. Currently, 6 processes, P1, P2, P3, P4, P5 and P6 are active in the system. The current snapshot of the system is shown in the table shown below. Determine a safe sequence (if one exists) for the given system state using Banker’s algorithm. Clearly show all the steps by calculating the Need data structure and the Available data structure at each step, the conditions that are satisfied and the sequence in which resource requests of processes can be satisfied. Note that you can answer this question by typing in the text box provided or uploading your answer.