I want to Find the number of operations required to evaluate the following program segment and therefore to find the complexity with respect to Big-O notation

Code:
int result = 0;
for (int i = 1; i<n; i++)
for (int j=1; j<n; j++)
result += i*j
return result;
any help plz