$3.$ Using $4-$bit numbers to save space, multiply

$4$

ten

$$

$$

$6$

ten,

$$

or

$0100$

two

$$

$$

$0110$

two

$$

$.$ Use the algorithm outlined in the flowchart in figure $3\mathrm{.}4$ and fill in what numbers, in the table, would populate in the Multiplier, Multiplicand, and Product in each step of each iteration. $\backslash$begin$\{$tabular$\}\{|$c$|$c$|$c$|$c$|$c$|\}\backslash$hline Iteration & Step & Multiplier & Multiplicand & $\backslash$begin$\{$tabular$\}\{|$l$\}$ Product $\backslash \backslash \backslash$end$\{$tabular$\}\backslash \backslash \backslash$hline $0$ & Initial Values & $0110$ & $00000100$ & $00000000\backslash \backslash \backslash$hline $\backslash$multirow$[$t$]\{3\}\{*\}\{1\}$ & $1$a: $1->$Prod$=$Prod$+$Mcand & & & $\backslash \backslash \backslash$hline & $2.$ Shift left Mcand & & & $\backslash \backslash \backslash$hline & $3.$ Shift right Mult & & & $\backslash \backslash \backslash$hline $\backslash$multirow$[$t$]\{3\}\{*\}\{2\}$ & $1$a: $1->$Prod$=$Prod$+$Mcand & & & $\backslash \backslash \backslash$hline & $2.$ Shift left Mcand & & & $\backslash \backslash \backslash$hline & $3.$ Shift right Mult & & & $\backslash \backslash \backslash$hline $\backslash$multirow$[$t$]\{3\}\{*\}\{3\}$ & $1$a: $1->$ProdmProd$+$Mcand & & & $\backslash \backslash \backslash$hline & $2.$ Shift left Mcand & & & $\backslash \backslash \backslash$hline & $3.$ Shift right Mult & & & $\backslash \backslash \backslash$hline $\backslash$multirow$[$t$]\{3\}\{*\}\{4\}$ & $1$a:$1->$Prod$=$Prod$+$Mcand & & & $\backslash \backslash \backslash$hline & $2.$ Shift left Mcand & & & $\backslash \backslash \backslash$hline & $3.$ Shift right Mult & & & $\backslash \backslash \backslash$hline $\backslash$end$\{$tabular$\}$