6) Write the code to implement the expression A-B-C*D' on two ISA Basic classes: Stack and Memory to Memory (3 address). The instruction sets are: 1) Stack- push, pop, add, sub, mul, div, etc; 2) Memory to Memory (3 address) add, sub, mul, div, etc. Assuming that addresses (of operand) are 16 bits, data values are 32 bits, and opcodes are 8 bits, compute the size of your program (code), in bytes, and the amount of (data) memory traffic the program would generate, in bytes, when it executes. For multiplication, it is assumed that 'n-byte n-byte' produces 'n- byte'. When you compute the amount of memory traffic generated by the program, compute separately the amount of traffic due to instruction fetch and execution. Memory Traffic (bytes) 3-address Memory Traffic Stack (bytes) 7+8 +4 mul A, C, D sub A B, A 78+4