(Simulate the banker's algorithm to see deadlocks. When a user requests a set of resources, it is necessary for the system to determine whether the allocation of those resources still leaves the system in a safe state. If so, the resource can be allocated; otherwise, the process must wait until some other process releases enough resources to stop.)