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

operation is carried out in ${10}^{-12}$ seconds, with these functions $f(n)?$

a$)loglogn$

b$)logn$

c$)(logn{)}^2$

d$)1,000,000n$

e$)n^2$

f$)2^n$

g$)2^{n^2}$