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 shortterm 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 no permanently deny processor time to processor$-$bound programs.