Suppose you have a machine that can perform 817 operations per second. Given the fo lowing functions (assume this is the exact number of operations as a function of n), what is the maximum size of n for which you can complete computation within an hour? Assume n must be an integer (a) f(n) -4n h)()3 (c) f(n) = 100000.log2(n) + 10 (d) f(n) - 87.(n/2) (e) f(n) -2