Question:(Program in Python)

Complete the method/class: bankers_algorithm(claim_vector, allocated_resource_table, maximum_table): pass

Brief Description of the Banker's Algorithm

The Bankers Algorithm is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety simulating the allocation of predetermined maximum possible amount of all resources, and then makes a s-state check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.

Please Note: Your code must be well organized and commented to show your understanding of the algorithm. Credits will be awarded for code clarity.

Code Structure Requirement

Your code should be either class or methods oriented

Inputs Format

Your method or class should take as arguments:

1. claim_vector type: list The maximum (as values) amount of each resources (eg. memory, UI, etc.) available.

2. allocated_resources_table: list How much (in value) of each resource each process is currently holding

3. maximum_claim_table: list How much of each resource the system currently has available

Return Format Show the simulation resulting from the Bankers Algorithm implementation in the format:

1. The processes execution, sequentially.

2. For each process execution display, also show the available resource stack for each resources

3. And indicate whether the processes are in a safe state or not (based on the algorithms output).

Extra

Viewing matrices in an unordered format isnt the best. Therefore,

1. Neatly display, in a tabular form, each process and the resource allocations as entered by the user.

2. Also display, similar to (1), the System Resource Table for each process as entered by the user.

3. Also indicate the current usage by active processes (claim vector).