4. (10 points] Stop, Wait a minute Suppose you have algorithms that execute the following exact (not asymptotic) num- ber of operations as a function of the input size n. If you have a computer that can perform 1010 operations per second, for each algo- rithm what is the largest (integer!) input size n for which you would be able to get the result within a minute? What is the largest input size n for which you would be able get the result within two minutes? Be as precise as possible. But, for once, no explanation necessary! You are welcome to use online tools for any calculations. (a) 60n2 (b) n3 (c) n (d) n log2 n (e) 21 Make sure you have two answers for each part