Question 1: Banker Algorithm A Banker algorithm is deadlock avoidance algorithm used for resource allocation. In the following example, there are five processes, P1, P2, P3, P4, P5 and three resource types A (with 10 instances), B (with 5 instances) and C (with 7 instances). The Available, Allocation and MAX matrices are given as: A 3 AVAILABLE B C 2 2 ALLOCATION A B C PO 0 1 0 P1 2 0 0 P2 3 0 2 P3 2 1 2 P4 0 0 2 Copyright 2022 VIT, All Rights Reserved. ITSA2003R Assignment] MAXIMUM A B C PO 7 4 4 P1 1 2 1 P2 5 0 0 P3 0 1 0 P4 4 3 1 A. Compute the need matrix B. After calculating the Need matric, show that the current state is safe by showing a safe sequence of processes. 2 Vit VICTORIAN INSTITUTE OF TECHNOLOGY