Having designed a binary adder already in class, you are now ready to design a 2-bit by 2-bit unsigned binary multiplier. The multiplier takes two 2-bit inputs, A[1:0] and BI1:0], and produces and output Y, which is the product of A[1:0] and B[1:0]. The standard notation for this is as follows: Y-A[1:0] . B[1:01. To help you with answering the questions below, first start by asking yourself what the maximum value that can be represented in 2 bits for A (i.e., A[I:01) a) 15 points] What is the maximum possible value of Y? What is the number of required bits to represent the 1. maximum value of Y? Briefly explain both answers. [5 points] Write a truth table for the multiplier described above. You will have a four-input truth table with the inputs being A[I], Al0], B[1], and BfO]. b)