for i in range$($N$*$N$)$:

for j in range$($i$)$:

for k in range$($j$)$:

Sum $+=1$

What is the running time of the following program fragment $($using Big$-$Theta$)$