Translate each of these MiniJava statements and expressions into IR trees, but using the Ex, Nx, and Cx constructors as appropriate. In each case, just draw pictures of the trees; an Ex tree will be a Tree Exp, an Nx tree will be a Tree Stm, and a Cx tree will be a Stm with holes labeled true and false into which labels can later be placed.

g.  a+5;

b. b[i+1]=0;

c.  while (a<> a=a+1;

d. amoves a 1 or 0 into some newly defined temporary, and whose right-hand side is the temporary.

e.  a = x+y;

f.   if (a c=b;