Q1. (60 points) Assuming

(92)_(10)=(abcdefg)_(2)

, a Boolean function

F(A,B,C,D)

is given by the\ following truth table:\ Q2. (40 points) Consider

F(A,B,C,D)

Boolean function given in Q1.\ a) Implement

F(ABCD)

using

3\\\\times 8

Decoders with 'Active High' output and Enable inputs and external\ gates,\ b) Implement

F(ABCD)

using a

8\\\\times 1

MUX and external gates, selecting

S_(2)=A,S_(1)=B

, and

S_(0)=C

.\ c) Implement

F(ABCD)

using a

8\\\\times 1

MUX and external gates, selecting

S_(2)=B,S_(1)=C^(')

, and

S_(0)^(')=D

.\ d) Implement

F(ABCD)

using a

4\\\\times 1

MUX and external gates, selecting

S_(1)=C

, and

S_(0)=D

.

Q1. (60 points) Assuming (92)10=(abcdefg)2, a Boolean function F(A,B,C,D) is given by the following truth table: (no+21)10=(abcdlefg)2 Q2. (40 points) Consider F(A,B,C,D) Boolean function given in Q1. a) Implement F(ABCD) using 38 Decoders with 'Active High' output and Enable inputs and external gates, b) Implement F(ABCD) using a 81 MUX and external gates, selecting S2=A,S1=B, and S0=C. c) Implement F(ABCD) using a 8x1 MUX and external gates, selecting S2=B,S1=C, and S0=D. d) Implement F(ABCD) using a 41 MUX and external gates, selecting S1=C, and S0=D