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 I nano-second. with these functions f(n)? Assume base-2 for log. (i) log n (ii) n (iii) n^2 (vi) 2^n