What is the largest n for which one can solve within one second u problem using an algorithm that requires f(n) bit operations, where each bit operation is carried out in 10?9 seconds, with these functions f(n)?a) log n________________b) n________________c) n log n________________d) n2________________e) 2n________________f) n!

Solution:Step-1:In this problem we need to find the largest n for which can solve with in one second problem using an algorithm requires f(n) bit operations, where each bit operation is carried out second with these functions f(n)..The negative exponent means that the expression in the denominator.Operation bit per second is .Step-2:a)consider,f(n) = log(n).Calculate the value of n.Consider, the base log is 2.So,.Therefore,Step-3:...