def

multiply$\_$using$\_$shift$\_$and$\_$add$($ A$,$ B$)$:

# Initialize result

result $=0$

# While the multiplier $($B$)$ is

not zero

while B $>0$:

# If the least significant bit

of $B$ is $1$

if B & $1$:

result $+=$ A # Add the multiplicand $($ A $)$ to the result

# Shift the multiplicand $($A$)$ left $($multiply by $2)$

# Shift the multiplier $($B$)$ right $($divide by $2)$

$B=B>1$

return result

Use this algorithem to draw the FSM $,$FSMD$,$ Datapath,Control unit