find complexity

Question

for(i=0;i<=n;i++)

    for(j=i;j<=n;j++)

           for(k=j;k<=n;k++)

                      S++;

Comments

can you please re-format question correctly so that i can understand what exactly the question is

Answer 1

for i =0 
______________________
j is 0 to N
so for j =0 
and k is 0 to N
No . of Computations will be N
so for j =1
and k is 1 to N
No . of Computations will be N -1

Similarly Total computations are N + N-1 + ........ + 1 = O(N²)
___________________________________________________
for i = 1 
Computations are like (N-1)²
______________________________________________
for i = 0 to N 
Computations are : N² + (N-1)² + ............ + 2²+1²
Overall O(N³)