Answer Happy

Please include ALL steps in your solution for example the
k-map etc...
the "no." is equal to 10 here
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)=(abcdefg), Q1.(40 points) ABCD F 0000 a) Implement F(ABCD) using 3x8 Decoders with 'Active High' output and Enable inputs and external gates, X 0001 a 0010 b b) Implement F(ABCD) using 3x8 Decoders with 'Active Low' output and Enable inputs and external gates, 0011 C 0100 d 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)? e 0110 f 0111 g 1000 X 1001 g 1010 f 1011 e 1100 d 1101 с 1110 b 1111 a x: don't care