Problem 12 (9 points): Assume that n is a positive integer. For each of the following algorithm segments, how many times will the innermost loop be iterated when the algorithm segment is implemented and run? 1) fork-1 to n for j 1 tok Statements in the body of the inner loop, none containing branching statements that lead outside the loop] next k 2) for k := 1 to n forj:- 1 to k for i := 1 to J