1. This problem covers 4-bit binary multiplication. Fill in the table for the Product,
Multplier and Multiplicand for each step. You need to provide the DESCRIPTION of the step being performed (shift left, shift right, add, no add). Use any of the algorithms presented in class.
The value of M (Multiplicand) is 1101, Q (Multiplier) is initially 1110.