6.5 Given the following state for the Banker's Algorithm 6 processes PO through P5 4 resource types: A (15 instances); B (6 instances) C (9 instances): D (10 instances) Snapshot at time TO: Available Current allocation Maximum demand Process A BC D A B C I P1 P2 P3 P4 P5 a. Verify that the Available array has been calculated correctly. b. Calculate the Need matrix. c. S how that the current state is safe, that is, show a safe sequence of processes. In addition, to the sequence show how the Available (working array) changes as each process terminates. Given the request (3,2.3.3) from Process P5. Should this request be granted? Why or why not? 6.5 Given the following state for the Banker's Algorithm 6 processes PO through P5 4 resource types: A (15 instances); B (6 instances) C (9 instances): D (10 instances) Snapshot at time TO: Available Current allocation Maximum demand Process A BC D A B C I P1 P2 P3 P4 P5 a. Verify that the Available array has been calculated correctly. b. Calculate the Need matrix. c. S how that the current state is safe, that is, show a safe sequence of processes. In addition, to the sequence show how the Available (working array) changes as each process terminates. Given the request (3,2.3.3) from Process P5. Should this request be granted? Why or why not