The Banker's Algorithm is a deadlock avoidance method used to regulate resource allocation to avoid deadlocks. Proposed by Dijkstra in 1965, Banker's Algorithm helps the bank to maintain its resources, thus staying in a safe state. The following table is the snapshot of a system: a) Identify how many instances for resources A,B and C ?. (3 marks) b) Complete the given table by calculating the MAXIMUM matrix, which indicates the maximum demand that the process needs to complete its task