Directions (Q96–100): The Banker's Algorithm is a deadlock-avoidance method in operating systems, designed to facilitate resource allocation without causing deadlock. It maintains information about the maximum resources each process may require, the currently allocated resources and the available resources in the system. The algorithm checks each resource request to determine whether granting it would leave the system in a safe state, meaning that there is always a sequence in which all processes can complete their execution without getting stuck due to resource unavailability. Each process must specify its maximum demand for each resource type before it starts execution. When a process requests additional resources, the algorithm checks if granting the request will keep the system in a safe state. If so, the resources are allocated; otherwise the process must wait until its request can be safely fulfilled.