Consider the following algorithm:

Algorithm Sum(m, n)

//Input: Two positive integers m and n where m n

//Output: ?

sum = 0

for i=m to n do

for j=1 to i do

sum = sum + 8

end for j

end for i

return sum

What is the final result of sum? Show and determine the formula for the total number of additions (sum = sum + 8) performed by the algorithm.