Suppose that a scheduling algorithm (at the level of short-term CPU scheduling) favors those processes that have

Question:

Suppose that a scheduling algorithm (at the level of short-term CPU scheduling) 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 not permanently starve CPU-bound programs?