Directions (Q96–100): The Banker's Algorithm is a deadlock-avoidance method in operating systems. It maintains information about the maximum resources each process may require, the resources currently allocated and the resources available. Each process must declare its maximum demand for each resource type before it starts. When a process requests additional resources, the algorithm checks whether granting the request leaves the system in a safe state — one in which there is a sequence that lets all processes complete. If so, the resources are allocated; otherwise the process must wait until its request can be safely fulfilled.