I. DUW E DIUL Uagram Tor Hoating-point multiplier, assuming the two operands follow the same IEEE-754 standard format. Ignore the rounding of the mantissa. 3. Write the most code-size-efficient (in terms of number of instructions) assembly code, assuming load and store instructions are available, for the following code: C= (a + b) * a; d = (a + b) *b; e = (a + b) *(c + d); for each of the following machine architecture a. Stack-based architecture b. Accumulator-based architecture c. (1,2)-GPR architecture d. (3,3)-GPR architecture I. DUW E DIUL Uagram Tor Hoating-point multiplier, assuming the two operands follow the same IEEE-754 standard format. Ignore the rounding of the mantissa. 3. Write the most code-size-efficient (in terms of number of instructions) assembly code, assuming load and store instructions are available, for the following code: C= (a + b) * a; d = (a + b) *b; e = (a + b) *(c + d); for each of the following machine architecture a. Stack-based architecture b. Accumulator-based architecture c. (1,2)-GPR architecture d. (3,3)-GPR architecture