Plz explain well with clear answer. Thank you!!

Compute the big O time complexity $($worst case$)$ of the following code. Show all

your work to get credit, including a table of steps to n $($as seen in class$),$ and then

all the summations and all your work to compute the time complexity.

for $($i$=1$; i$<=($n$-5)$; i$++)\{$

for $($j$=$i$+1$; j$<=($n$-2)$; j$++)\{$

for $($k$=$j$+1$; k$<=$n; k$++)\{$

print$("$Hello Class"$)$;

$\}$

$\}$

$\}$