please show all work

4. [2 pts] Suppose you have algorithms with the running times listed below. (Assume these are the exact number of operations performed as a function of the input size n.) Suppose you have a computer that can perform 10-2 operations per second, and you need to compute a result in at most an hour of computation. For each of the algorithms, what is the largest input size n for which you would be able to get the result within an hour. a) na b) n c) 10n d) log n e) 2 f) 2211