sub $$10,s+0,s+111(x[400]+y)-(y[200)+y)+0$

Sw $9+0,1200($$$52)11[300]+0$

b$.$ Now convert into machine code. Show your work by choosing the correct formats and filling the fields. $($Represent it in binary, not hex.$)$ machine code: $1000111001101000000000000010000100000000001000$ o$10001010111001001000$

FIGURE $3\mathrm{.}4$ The first multiplication aigorithm, using the hardware shown in Figure $3\mathrm{.}3.$ If

the least significant bit of the multiplier is $1,$ add the multiplicand to the product. If not, go to the next step.

Shift the multiplicand lett and the multiplier right in the next two steps. These three steps are repeated $32$

Shift

$5.(15$ points$)$ Using $4-$bit numbers to save space, multiply ${12}_{\text{t}\text{o}\text{m}}**7_{\text{t}\text{e}\text{n}},$ or ${1100}_{\text{t}\text{w}\text{o}}**{0111}_{\text{t}\text{w}\text{o}}.$ Use the algorithm outlined in the flowchart in figure $3\mathrm{.}4$ and fill in what numbers, in the