(e) Give a big-O estimate for the number additions used in this segment of an algorithm. 1:=0 for i = 1 ton for j=1 to n 1:=1+i+j (f) 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 Inano-second, with these functions f(n)? Assume base-2 for log. (i) log n (ii) n (iii) n (vi) 2"