3. Consider the Banker's Algorithm where the devices are all the same. Here is a system with 24 devices: Devices Allocated Maximum Required Remaining Needs 4 Job 2 4 10 14 a. Calculate the number of available devices. b. Determine the remaining needs for each job in the system c. Determine whether the system is in a safe state or an unsafe state. d. If the system is in a safe state, list the sequence of requests and releases that will make it possible for all processes to run to completion. Have each job complete with its maximum number of resources. e. If the system is in an unsafe state, show how it is possible for deadlock to occur f. If the system is in an unsafe, explain why if would still be possible that deadlock will not occur