Problem #3 Perform A x B, where A-1010 and B-1101, using three different algorithms. For each algorithm, draw their hardware implementation and show the register contents at each step. Moreover, compare the number of steps required for these algorithms to perform the operation. (a) Serial multiplier algorithm treating the two values (A & B) as unsigned numbers. (b) Serial optimized multiplier algorithm treating the two values (A & B) as unsigned numbers. (c) Signed multiplication algorithm with operands in 2's complement notation (using sign (75) extension and subtraction of the last partial product)