Question $43(1$ point$)$

What is the smallest worst$-$case asymptotic runtime of the following loop $($i$.$e$.$ the

tightest bound$)?$

for $j-1$ to $n*n*n$ do

for $k-1$ to $j$ do

sum $-$ sum $+1$