Multiplier, multiplicand, and product registers are the three registers we will be using to solve this particular problem.
Initializing the product register to 0, and the multiplier and multiplicand values of course to the multiplier and multiplicand.
We will check the least significant bit in the multiplier register and add the value of the multiplicand register to the product register if the least significant bit is 0.
Then we will shift the multiplier register right 1 and the multiplicand register left 1.
Now we will repeat this entire process until the multiplier register holds the value 0.