What is the largest [FONT=MathJax_Math]

*n*[/FONT] for which one can solve within one second a problem using an algorithm that requires [FONT=MathJax_Math]

*f*[FONT=MathJax_Main]([FONT=MathJax_Math]

*n*[FONT=MathJax_Main])[/FONT][/FONT][/FONT][/FONT] bit operations, where each bit operation is carried out in [FONT=MathJax_Main]10[FONT=MathJax_Main]−[FONT=MathJax_Main]4[/FONT][/FONT][/FONT] seconds, with these functions [FONT=MathJax_Math]

*f*[FONT=MathJax_Main]([FONT=MathJax_Math]

*n*[FONT=MathJax_Main])[/FONT][/FONT][/FONT][/FONT]?

The first one is is for log n, if anyone can help me by walking through this one step by step, I'm sure I can get through the rest. Or if you can even write a similar equation and show me how to solve that, I'm sure I can get it, I just seem to have NO idea where I'm going with it. Thanks in advance!