$1.(40$ points$)$ Translate the high$-$level language code below into assembly instructions. The variables

A$,$ B$,$ C$,$ D$,$ E and F are located in the memory and can be accessed by their label $($e$.$g$.,$ LOAD R$2,$ A

will load A from the memory into R$1).$ Minimize the number of instructions in the assembly code that

you write.

F $=($X$-$Y$)*($Z$+$W$)/($L$-$W$)$

a$)$ Write the code for an accumulator architecture

b$)$ Write the code for a stack architecture. Assume that the division $($subtraction$)$ operation

divides $($subtracts$)$ the topmost value in the stack by the second topmost value.

c$)$ Write the code for a register$-$memory architecture

d$)$ Write the code for a load$-$store architecture

e$)$ Compare and count the number of instructions and memory accesses between the different

ISAs in the previous parts of the questions $($ a$,$ b$,$ c and d$)1.(40$ points$)$ Translate the high$-$level language code below into assembly instructions. The variables

A$,$ B$,$ C$,$ D$,$ E and F are located in the memory and can be accessed by their label $($e$.$g$.,$ LOAD R$2,$ A

will load A from the memory into R$1).$ Minimize the number of instructions in the assembly code that

you write.

F $=($X$-$Y$)*($Z$+$W$)/($L$-$W$)$

a$)$ Write the code for an accumulator architecture

b$)$ Write the code for a stack architecture. Assume that the division $($subtraction$)$ operation

divides $($subtracts$)$ the topmost value in the stack by the second topmost value.

c$)$ Write the code for a register$-$memory architecture

d$)$ Write the code for a load$-$store architecture

e$)$ Compare and count the number of instructions and memory accesses between the different

ISAs in the previous parts of the questions $($ a$,$ b$,$ c and d$)$