Consider multiplying two unsigned integers in base 10: 312 201 312 624 62712 a. Using the same multiplication algorithm with m-5 bits, provide two examples of multiplying unsigned binary numbers (note your answer will require more than b. What is the minimum number of bits required to store the product of two c. In general, what is the minimum number of bits required to store the product of d. Using the same algorithm, provide two examples of multiplying two signed two's e. Discuss any potential problems associated with your examples in part (d). In m-5 bits). unsigned 5-bit numbers? two unsigned m-bit numbers? complement binary integers. addition, discuss a possible remedy that might fix those issues