Objective: By using Banker's Algorithm, you will be able to show a resource allocation system with multiple instances of each resource type. Instead of being restricted to resource-allocation graphs, you can represent source allocation through matrix and numbers. In completion of this question, you will be able to create and fill in a matrix by calculating the available resources of a system and what is needed for each process. Using your knowledge of Banker's Algorithm, fill in the shaded missing cells in the following table under the Available and Need column. Assume resource Type A has 9 instances, resource Type B has 8 instances, and resource Type C has 11 instances. Available ABC Need ABC P1 P2 P3 P4 P5 Allocation ABC 223 | 101 302 001 341 Max ABC 433 202 513 111 555 Is the current system in a safe state? State why or why not. If the system is not in a safe state and results in a deadlock, which process do you think should be terminated to free up resources for the other processes? Explain your answer. Using your answer from the previous question, if that process was terminated, how many instances of each resource would be available