Assuming a computer can perform 109 operations per second. Three algorithms are executed on this computer with the counts of operations of (a) f (n),...

Assuming a computer can perform 109 operations per second. Three algorithms are executed on this computer with the counts of operations of (a) f(n), (b) f(n2) and (c) f(log2n), respectively. What is the largest number n that each of the algorithms can be executed in 2 second? (Do not need to use calculator - leave the numbers in scientific notation)

(a) for f(n), it is 

(b) for f(n2), it is    

(c) for f(log2n), it is