In regards to Operating Systems Concurrency: Deadlock and Starvation

Given the following state of a system, which comprises of 5 processes (P1-P5) and 4 resources (R1-R4): Total existing resources: R1 R2 R3 R4 6343 Snapshot at the initial time stage Allocation Claim R1 R2 R3 R4 R1 R2 R3 R4 P130116 211 P2 0 1000 212 P3 1 1 1 0 3 21 0 P4 1 1 0 1 1 1 1 1 |P5 0|0|0|0|2 a. Compute the Available vector. b. Computer the Need matrix. c. Is the current allocation state safe? If so, give a safe sequence of the process. In addition, show how the Available (working array) changes as each process terminates. d. If the request (1, 1, 0, 0) from P1 arrives, will it be correct to grant the request? Justify your decision.