Find the worst$-$case complexity of below code.

Function former:loop$($i$)$

$x$:$=0$

for $1$:$-1$ fon$-1do$

for $j$:$=1+1$ tondo

for $k=-1to$