3 parts: f(n) = 1000n , f(n) = n^2, f(n) = 2^n

Problem 2. 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) 1000 n b) na c) 2n