Consider a system with 14 dedicated devices of the same type. all jobs currently running on this system require a maximum of five devices to complete their execution but they each run for long periods of time with just three devices and request the remaining two only at the very end of the run. assume that the job stream is endless and that your operating system’s device allocation policy is a very conservative one: no job will be started unless all the required drives have been allocated to it for the entire duration of its run. using banker's algorithm,
a. what is the maximum number of jobs that can be in progress at once? explain your answer.
b. what are the minimum and maximum number of devices that may be idle as a result of this policy? under what circumstances would an additional job be started?