Required information

Skip to question

NOTE: This is a multi$-$part question. Once an answer is submitted, you will be unable to return to this part.

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 $109$ seconds, with the given functions f$($n$).$

log n$,$ where the base of the logarithm is $2$