$2-$Address

Machine

MOV T$1,$ B

SUB T$1,$ C

MPY T$1,$ D

MOV A$,$ T$1$

$3.$ 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, addresses occupy two bytes, and

data values also occupy two bytes. The word length is $1$ byte. The table below shows

the four programs

$3-$Address

Machine

SUB A$,$ B$,$ C

MPY A$,$ A$,$ D

$1-$Address

Machine

LOAD B

SUB C

MPY D

STORE A

$0-$Address

Machine

PUSH B

PUSH C

SUB

PUSH D

MPY

POP A