In a real computer system, neither the resources available nor the demands of processes for resources are consistent over long periods(months). resources break or are replaced, new processes come and go, and new resources are bought and added to the system. if deadlock is controlled by the banker's algorithm, which of the following changes can be made safely (without introducing the possibility of deadlock), and under what circumstances? a. increase available (new resources added) b. decrease available (resource permanently removed from system). c. increase max for one process (the process needs or wants more resources than allowed). d. decrease max for one process (the process decides it does not need that many resources). 2) consider the following snapshot of a system: allocation abcd po 2001 p1 3121 p2 2103 p3 1312 p4 1432 max available abcd 3321 abcd 4212 5252 2316 1424 3665 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 processes may complete. b. if a request from process pi arrives for (1, 1, 0, 0), can the request be granted immediately? c. if a request from process p4 arrives for (0, 0, 2,0), can the request be granted immediately? 3) assuming a 1-kapage size, what are the page numbers and offsets for the following address references (provided as decimal numbers): a. 3085 b. 42095 c. 215201 d. 65 e. 21 4) consider the following segment table: segment base length 219 90 1952 600 14 100 1327 580 what are the physical addresses for the following logical addresses? a. 0,430 c. 2,500 d. 3,400 e. 4,112