Problem
Suppose you have programs whose running times in microseconds for an input of size n are 1000 lg n, 100n, 10n2 , and 2n . Find the largest size n of input that can be processed by each of these programs in (a) one second, (b) one minute, (c) one day, and (d) one year.