Could anyone help me solve this Data Structure question? Thanks a lot.

what is the Big O notation (worst-case asymptotic time complexity) for the following program fragment? Justify your answer.

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

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

cout<< i*j <<

}

}