What is the difference between deadlock prevention and deadlock avoidance?

Provide an example scenario for each approach.

Explain the Banker's algorithm for deadlock avoidance in detail. How does it

work, and what are its key features?

Using the Banker's algorithm, analyze the given system snapshot to determine

whether each of the following states is unsafe. If the state is safe, illustrate the

order in which the threads may complete. Otherwise, explain why the state is

unsafe. Consider the following snapshot of a system:

Using the Banker's algorithm, determine whether each of the following states

is unsafe:

a$.$ Available resources: $(0,3,0,1)$

b$.$ Available resources: $(1,0,0,2)$