Textbook Problem

In 8 and 9, how many times will the innermost loop be iterated when the algorithm segment is implemented and run? Assume n, m, k, and j are positive integers.

8. for $m:=1$ to n
for $k:=1$ to m
for $j:=1$ to k
for $i:=1$ to j
[Statements in the body of the inner loop, none containing branching statements that lead outside loop]
next i
next j
next k
next m