2. Find the Big-O complexity of the following fragment by using summations:

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

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

x = x + 2;

}

}