The minimum number of full adders needed in (3-bit multiplicand by 2-bit multiplier) multiplier is Select one: Spar O A.2. OB. 1 O C.3 O D.4 The minimum number of AND gates needed in (3 bit multiplicand by 3 bit multiplier) multiplier is Select one O A6 Spark B.5 O C.3 O 0.9 How many MUX we need to implement a truth table with 3 inputs and 4 outputs? Select one: O A2 Spark O B. 1 OC. 4 O D.3