Determine how many times the innermost loop will be iterated when the following algorithm segment is implemented and run. $($Assume that

a$,$ b$,$ c$,$ and d

are positive integers. Assume

a $<=$ b and c $<=$ d$.)$

for i :$=$ a to b

for j :$=$ c to d

$[$Statements in body of inner loop.

$$None contain branching statements that

$$lead outside the loop.$]$

next j

next i