consider the following C++ program fragment where n 0;

y = 0;

x = n;

while (x > 0) {

y = y + n;

x = x - 1

}

determine whether the following loop invariant is correct. show all step nessary to prove a loop invariant.

y= x*n^(x<0)

Hint: draw a table of values for the variables to check the loop invariants