Show how the unsigned serial multiplication method would compute M × Q where M = 10110 and Q = XXXXXXXXXXM and Q are unsigned numbers. For each step, describe in words what is happening (shift left,...

Show how the unsigned serial multiplication method would compute M × Q where M = 10110
and Q = 01101. M and Q are unsigned numbers. For each step, describe in words what is
happening (shift left, shift right, add/subtract M or Q into product, set a bit, etc.), and show
the product (or partial product) for that step. (Note: Q is the multiplier and M is the
multiplicand.)