Answer Happy

Try to optimize the following code with constant folding int y = 4; int w = 3; int z = 0; W = y-6; while (x-y > 0) { y = y + 1; if (x >= y) { Z = W; } else { z = 0; } } return z;