Assume n is a positive integer. For the following algorithm segment, how many times will the innermost loop be iterated when the algorithm segment is implemented and run??

for k := 1 to n for j := 1 to k-1 for i := 1 toj-1 [Statements in the body of the inner loop, none containing branching statements that lead outside the loop) next i nextj next k