COT 3100 Intro. To Discrete Structures Problem 1: 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? (5 points for each) 1. for k-1 to n for j1 to k for i:- 1 toj [Statements in the body of the inner loop, none containingg branching statements that lead outside the loop] next ? next j next k 1 to n for i', 1 to k-1 2. for k for1 toj-1 [Statements in the body of the inner loop, none containing branching statements that lead outside the loop] next ? next j next k