What is the largest n for which one can solve within one second a problem using an algorithm that requires f (n) bit operations, where each bit operation is carried out in 10−9 seconds, with these functions f (n)?
a) log n
b) n
c) n log n
d) n2
e) 2n
f) n!