So I am confused on this problem for my discrete math class, I didn't know if there was a specific formula you were supposed to use or what. The question is "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^-6 seconds, with these functions?

a. f(n)= n^3

b. f(n)= 3^n

c. f(n)= 3^n * n^3

Can someone please help me with these answers and explain how they got them?