ANSWER THE FOLLOWING QUESTIONS 1. Simplify the following Boolean expressions to a minimum number of literals using laws of Boolean algebra: (a) (a b c)(a'b' +c) b) Ca+ c(a'+ b + c) (a'+ b'+ c) Draw logic diagram of original and simplified Boolean expressions of Question 1 2. 3. Implement the Boolean function F given below: F= x, y, + x, z + xy (a) With AND, OR and NOT gate:s With OR and NOT gates With AND and NOT gates With NAND and NOT gates With NOR and NOT gates (b) (c) (d) (e) 4 (a) Using truth table find sum-of-minterms and product-of- maxterms form for functions F1 and F2. (b) Simplify the following Boolean Functions F1 and F2 to a minimum number of literals to get Sum of products and product of sums. (Note:- Find Sum of Minterms for F1 and simplify it. Similarly work for F2) A B C F F2 5. Without Using truth table find sum-of-minterms and product- of- maxterms for function F given below: F(w,x,y,Z)= x, y, + x, z +w x y END *