Implement and Compute the total memory traffic in bytes for both instruction fetch and instruction execution for the code that implements the expression a=(b*c) d on 3-, 2-, 1-, and 0- address machines. Assume opcode occupy one byte, address occupy two bytes and data values also occupy two bytes. The word length is one byte.

Convert the given  code fragment to assembly code fragment, using only instructions of the following types. These instructions are generally discussed in class. Here X,Y,Z are  any memory locations;  R, R1, R2 are any general registers; L is a label in the code (you can use any names as labels, ex. L, L1, L2 etc. ). load X, R //copy contents of memory location X into R. store R, X //Store contents of R into Mem location X cmp R1, R2 //Compute R1-R2 and update condition codes;                                                 //throw away result of subtraction. jmp L                       //Jump to location L in the code. jmpp L                      //If P bit is 1, Jump to location L in the code add X, R //Add contents of X,R and store result in R;                                    //Also update the condition codes.   Be careful about what type of argument is allowed in the instruction (Memory or Register). Ex. the first argument of ADD instruction is memory, not register.   Do Not…

Question 1 Consider two C++ int arrays A and B. The base address of A is held by $=0, and B $s1. Variable i A Bx Y Variable i is an index into A. Assume i is never out of Register $to $s0 $s1 $s2 $=3 index bound. Variable x and y are C++ int variables. Write the instructions corresponding to the C+ code block below. Each task is independent. i. BI 6 1 = AL 11 1 + BI 3 1; * Sti = Al 11 1 1 2 3 * St3 = Al 11 ] + BI 3 1 co

PLEASE HELP