Consider a machine with the following instruction: mult const1(src1), const2(src2), dst3 r3 ← M[r1 + const1]∗ M[r2 + const2]
On this machine, r0 is always 0, and M[1] always contains 1.
a. Draw all the tree patterns corresponding to this instruction (and its special cases).
b. Pick one of the bigger patterns and show how to write a Java if-statement to match it, with the Tree representation used for the MiniJava compiler.