$(15$ points$)$ Using $4-$bit numbers to save spece, multiply ${12}_{\text{l}\text{e}\text{n}}*7_{\text{t}\text{e}\text{m}\text{,}}$ or ${1100}_{\text{t}\text{w}\text{o}}*0111$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$table$[[$Iteration $1,|1|1,$Step,Muttiplien,Multiplicand,Product$],[$Y$,$Initial Values $,,0111,00001100,00000000],[1,10$:$1$ Prad$-$Prect $1$ m $$and,,,$],[2.$ Srift Left Micand,,,$],[3.$ Strift rieht Mult,,,$],[2,1$a: $1->$Prot$-$PrDd$+$Mcand,$11,,],[2.$ Srift left Mcand,i$),,],[3.$ Srift rieht Mult,$,,],[3,1$a: $1->$Prod$-$Frod$+$Mcand,,,$1],[2.$ Srift left Mcand,,,$1h_1^1$