3.3.16 What is the largest n for which one can solve within a day using an algorithm that requires f (n) bit operations, where each bit operation is carried out in 10?11 seconds, with these functions f(n)?

a) log(n)

b) 1000 n

c) n^2

d) 1000 n^2

e) n^3

f) 2^n

g) 2^2n

h) 2 ^2n