Please show all steps

In real computer system, resources are not available over long periods of time a (months). Resources break or are replaced; new resources are added to the system. The demand for resources by processes is also not consistent. New processes come and go. Suppose you have designed a deadlock prevention scheme using the Banker's Algorithm which of the following changes can you make safely, i.e., without the possibility of introducing deadlocks? Under what circumstances can you make these changes? How would you make these changes? . a. Add new resources to the system. b. Permanently remove resources from the system. c. Allow a process to request more resources than the max it specified. d. Allow a process to reduce the max number of requests in needs. e. Increase the number of processes. f. Decrease the number of processes