An i/o-bound program is one that, if run alone, would spend more time waiting for i/o than using the processor. a processor-bound program is the opposite. suppose a short-term scheduling algorithm favors those programs that have used little processor time in the recent past. explain why this algorithm favors i/o-bound programs and yet does not permanently deny processor time to processor-bound programs.

Answer with Explanation:

An I/O-bound the programs that are used relatively a little processor times and are favored by an algorithm. However, if the processor bound process is denied the processor time for the sufficiently long periods of times, the same algorithms will be granted a processor to the process and it has not use the processors at all in recent pasts. Therefore, the processor bound process will not be the permanently denied to access.

answer; i believe the correct answer is (a) all trenches must have access/egress;