Consider the code segment
int i, j, x, y, m, n;
n = 20;
for (i = 0, i < n; i++)
{
for (j = 0; j < n; j++)
{
if (i % 2)
{
x + = ((4*j) + 5*i);
y += (7 + 4*j);
}
}
}
m = x + y;
Which one of the following is false?

A

The code contains loop invariant computation

B

There is scope of common sub-expression elimination in this code

C

There is scope of strength reduction in this code

D

There is scope of dead code elimination in this code