$10.$ Neither mul$]$plica$]$on nor division are supported by the MSP$430$ CPU ALU. For mul$]$plica$]$on some microcontroller models include hardware mul$]$plier peripherals which can be used; otherwise,

mul$]$plica$]$on must be realized by somware. Both mul$]$plica$]$on and division of unsigned numbers can be realized by direct brute force methods. That is Mul$6$plica$6$on: To mul$]$ply AxB, add A $]$mes B$.$ Division: To divide A$/$B$,$ subtract B from A as many $]$mes as possible un$]$l the difference is smaller than B$.$ The difference is the residue R and the number of subtrac$]$ons is the quo$]$ent Q$.$

a$.$ Test your understanding by mul$]$plying $11$x$3$ and dividing $11/3$ by hand with the algorithms.

b$.$ If each factor in a mul$]$plica$]$on is n bits wide, what is the number of bits that we must reserve for the product?

c$.$ Write pseudo codes or draw a flowchart for each opera$]$on$,$ and encode them in assembly language. For the mul$]$plica$]$on$,$ assume both factors are bytes.

For the division A$/$B$,$ assume A is a $16-$bit word and B a byte.