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.)Assume $a\le b$and $c\le d$

$\begin{array}{c}\text{for}i\text{:=a}\text{to}b\\ \text{for}j:=c\text{tod}\\ [Statementinbodyofinner\\ loop.Nonecontainbranchingstatementsthat\\ leadoutsidetheloop.\text{]}\\ \text{next}\text{k}\\ \text{next}j\end{array}$