def riddle$($n$)$:

p $=0$

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

i $+=1$

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

for k in range$(1,$ i $+1)$:

p $+=1$

return p what is the time complexity of this algorithm what is the time complexity of this algorithm