What would be the time complexity of the following algorithm?

int sum $=0$;

for $=i+j+k+1(n^{4}logn)(n^4)O(n^3)(n^3)(1=0$;$1$

sum $=i+j+k+1$;

$\}$

$(k=0$;$k$

$if(i==j==k)\{$

for $(1=0$;$1$

sum $=i+j+k+1$;

$\}$

$\}$

$\}$

$(j=$;$j$

for $(k=0$;$k$

$if(i==j==k)\{$

for $(1=0$;$1$

sum $=i+j+k+1$;

$\}$

$\}$

$\}$

$\}$

$(i=0$;$i$

for $(j=$;$j$

for $(k=0$;$k$

$if(i==j==k)\{$

for $(1=0$;$1$

sum $=i+j+k+1$;

$\}$

$\}$

$\}$

$\}$

$\}$

$(n^{4}logn)$

$(n^4)$

$O(n^3)$

$(n^3)$