Textbook Problem

In each of 24-28, determine how many times innermost loop will be iterated when thw algorithm sefrnent is implemented and run. (Assume that $m,n,p,a,b,c$and d are all positive integers.)
$\begin{array}{c}\text{for}j\text{:=1}\text{to}m\\ \text{for}k:=1\text{to}n\\ \text{for}k:=1\text{to}p\\ [Statementinbodyofinner\\ loop.Nonecontainbranchingstatementsthat\\ leadoutsidetheloop.\text{]}\\ \text{next}\text{k}\\ \text{next}j\end{array}$