If run by itself, an I/O bound program spends more time waiting for I/O than using the processor and vice versa for the processor-bound. Given a short-term scheduling algorithm favoring 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.