The correct answer is: A. deadlock prevention.
The Banker’s algorithm is a resource allocation algorithm that prevents deadlocks from occurring. It does this by keeping track of the resources that each process has requested and the resources that are currently available. The algorithm then ensures that no process can request more resources than it can currently hold without causing a deadlock.
Deadlock avoidance is a similar algorithm that also prevents deadlocks from occurring. However, it does this by dynamically adjusting the resources that are available to each process, rather than keeping track of the resources that each process has requested.
Deadlock recovery is a process that is used to recover from a deadlock that has already occurred. It does this by rolling back one or more of the processes that are involved in the deadlock, and then reallocating the resources that were being used by those processes.
Mutual exclusion is a technique that is used to ensure that only one process can access a resource at a time. It does this by using a lock to control access to the resource.
I hope this helps!