2. Suppose that you have algorithms with the size running times listed be- low. Assume that these are the exact number of operations performed as a function of the input size n. Suppose you have a computer that can perform 1010 operations per second, and you need to compare 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? (i) n . (ii) n (iii) 100m2. (iv) 2