Problem 3. [Category: Analysis] Estimate the running times, in terms of n, of the following three programs. You should give tight bounds, of the form (f(n)) with f as simplified as possible. Justify your answers. (You can assume that arithmetic operations take time in (1), no matter the size of the operands. Recall that the scope of language constructs is determined by indentation, so in (c), j2j is part of the while loop but not of the for loop.) [15 points]