Problem $5.$ What is the time complexity of the following algorithm in terms of $n?$ Your answer should be of the form $(f(n))$ for some $f(n).$

# $n$ is a natural number

$de\frac{f}{b}ar(n)$ :

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

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

for $k$ in range$(i,j$ :

print $($k$)$