Q Consider the Boolean function F(A, B, C, D) = 3,5,6,11,13 with don't care conditions Σα 0, 2, 7, 9, 12, 15 : - Write down the truth table of the function F. ii- Simplify the function F to 5 literals only. iii- Implement the simplified representation of function F using NAND gates only. iv- Implement the function F using a 4×16 decoder and only one gate if needed. v- Implement the function F using an 8×1 multiplexer and only one gate if needed. I need to solve all the demands

Given the truth table of a set of digital circuits with four inputs (a,b,c and d) and three outputs (F, G and H). b) Use VEM (variable entered mapping) to simplify the expressions for output G only, and write down the logic expression. You are to use the least significant bit (d) as your variable. Implement the circuit using only 2:1 mux devices. No. 0 1 2 .. 3 4 5 6 •NHN35 T 7 8 ....... 9 Input Outputs abcd F G H 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 10 1010 11 1011 0 0 0 HOOXOHXOXO 1 0 0 12 1100 1 HO 1 0 1 1 14 1110 X 15 1111 1 X X 0 1 1 0 X X 1 1 X 0 HOHXOOH XHHOHO 13 1101 0 0 0 1 1 1 1 1 0

1. Using Boolean algebra to simplify the following expressions. Then find the truth table of each after connecting the circuits. a. F A B+A (B+C) + B (B+C) b. F (A+B+A B) (A+B) c. F (A B) e (B C) d. F, (AO B) (BO C) %3D %3D %3!

1)implement the following boolean function using only a multiplexer (mux). f(a,b,c,d)= sum(0,3,5,7,8 9,10,12,15)