Csci 430 introduction to Operating system please help thank you

Problem #2 Given the following state for the Banker's Algorithm. 6 processes PD through P5 4 resource types A (15 instances); B (6 instances) C (9 instances); D (10 instances) and the following snapshot at time TO: Available 6 3 5 1 Current Allocation A B C D 2 1 1 m 12 1 I 1 1 O --- ----- 1 Maximum clemand . 3 3 2 5 1 3 5 1 Questions 1. Verify thal the Available array has been calculated correctly. 2. Calculate ile Need matrix. 3. Show iliat the current state is safe. Ilial is. show a safe sequence of pro- resses. In addition to the sequence show how the Available working arrar changes as eacl process terminales, 1. Given the request (3. 2. 3. 31 from Process P5, should this request be stanled? Wly or why nou