Question-65
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 operations, where each bit operation is carried out in 
second , with these functions f (n) ?
For question (a ) to (c) , enter the exact answers. Enter brockets around exponents. Round your answers down to the nearest integer for all other parts. Note that log n = log2 n.
a) log n
n = ?
b) n
n = ?
c) n . log n
= ?
d) 
n = ?
e) n!
n = ?
Solution
a) 
b) 10000
c)
d) 100
e) 13
f) 7