PLEASE SOLVE QUESTION 2!!

Assuming (no+23) = (abcdefg), consider the Boolean function F(A,B,C,D) given by the following truth table for all the questions: (no +23) 0 = (abcdefg) Q1.(40 points) ABCD F a) Implement F(ABCD) using 3x8 Decoders with 'Active High' output and Enable inputs and external gates, 0000 X 0001 a 0010 b 0011 0100 d b) Implement F(ABCD) using 3x8 Decoders with 'Active Low' output and Enable inputs and external gates, 0101 c) Is it possible to implement F(ABCD) with decoders using logic gates with smaller number of inputs than given in part a) or part b)? 0110 f 0111 g 1000 Q2. (60 points) X 1001 g 1010 f a) Implement F(ABCD) using a 8x1 MUX and external gates, choosing inputs A, B, C as the selection inputs of the MUX. b) Implement F(ABCD) using a 8x1 MUX and external gates, 1011 e 1100 d 1101 1110 b 1111 a choosing inputs B, C, D as the selection inputs of the MUX. c) Implement F(ABCD) using a 4x1 MUX and external gates, choosing inputs B and C as the selection inputs of the MUX. x: don't care