23 suppose that a cpu scheduling algorithm favors those processes that
Question
23. Suppose that a CPU scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favor I/O-bound programs and yet