What is the big-O analysis of the following code fragment?

Justify your answer.

k=0;

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

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

k += n;

}

}