Suppose a basic block is formed from the C assignment statements
x = a + b + c + d + e + f;
y = a + c + e;
a) Give the three-address statements (only one addition per statement) for this block.
b) Use the associative and commutative laws to modify the block to use the fewest possible number of instructions, assuming both x and y are live on exit from the block.