For the algorithm below complete the last column of the table attached to determine the number of times each operation is executed and the total time taken to execute Calcum$(10).$

Algorithem CalSum$($n$)$

Sum $=0$

For J $=0$ to n

For k $=$J$+1$ to n

Sum $=$ sum $+$j

Return Sum

Also show how you can work out this question using Summations to get the basic operation. IF POSSIBLE.

$\backslash$table$[[$Operation$,$Symbol,Cost$/$Ms$,$No$.$ Of Operations$],[$Addition$,+,5,],[$Assignment$,=,1,],[$Increment$,$x$++,3,],[$return$,,1,],[,,$Total Time Taken,$]]$