Consider a computer system involving 4 processes (PI, P2, P3, and P4) and 5 different types of resources (RI, R2, R3, R4, and R5). Assume that 2 instances of R1, 1 instance of R2, 1 instance of R3, 2 instances of R4, and 1 instance of R5 exists. Process P1 P2 P3 P4 Allocated R1 R2 R3 1 0 1 1 1 0 0 0 0 0 0 0 R4 R5 1 0 0 0 1 0 0 0 Request R2 R3 R4 1 0 0 1 0 0 0 0 0 R1 0 1 0 0 0 0 1 R5 1 1 1 1 R1 Available R2 R3 R4 R5 a) Fill in the "available" vector. b) Apply the deadlock detection algorithm to show whether there is a deadlock or not. Clearly show the applied steps and do necessary explanations. Activate Wind