Given the following segment of C code of two consecutive statements $($ONE program$),$

x $=$ a $+($b $*$ c$)$;

y $=($b $*$ c$)+($x $*$ a$)$;

for a $(1,2)-$GPR architecture, compile it into the most code$-$size$-$efficient $($in terms of number of instruc

tions$)$ assembly code, assuming load and store instructions are all available. You also need to minimize

the number of memory accesses. There are no limits on the number of registers you can use but always

minimize the number used