The multiplier takes two 2-bit inputs, a[1: 0] and b[1: 0], andproduces and
output y, which is the product of a[1: 0] and b[1: 0]. thestandard notation for this is:
y = a[1: 0] . b[1: 0]
a. what is the maximum possible value of y?
b. what is the maximum value that can be represented in 2 bitsfor a (i. e., a[1: 0])?
c. what is the maximum value that can be represented in 2 bitsfor b (i. e., b[1: 0])?
d. what is the number of required bits to represent themaximum value of y?
e. write a truth table for the multiplier described above. youwill have a four-input truth table with
the inputs being a[1], a[0], b[1], and b[0].
f. implement the third bit of output, y[2], from the truthtable using only and, or, and not
gates.