Consider the following C-program.
a = 1;
b = c * d;
e = c + a;
If (e < 10)
{
t1 = 2 * d;
}
else
{
t1 = e/2;
}
Which of the following optimization methods can be used?
1
Constant folding
2
Constant propagation
3
Dead code elimination
4
None of the above