Consider the following snapshot of a system:

Allocation Max Available

ABCD ABCD ABCD

T0 3141 6473 2224

T1 2102 4232

T2 2413 2533

T3 4110 6332

T4 2221 5675

Answer the following questions using the banker’s algorithm:

a. Illustrate that the system is in a safe state by demonstrating an order in which the threads may complete.

b. If a request from thread T4 arrives for (2, 2, 2, 4), can the request be granted immediately?

c. If a request from thread T2 arrives for (0, 1, 1, 0), can the request be granted immediately?

d. If a request from thread T3 arrives for (2, 2, 1, 2), can the request be granted immediately?