Question 1: Simplify the following Boolean expressions using De Morgan law and Boolean Algebra rules. Show process steps and your work clearly. Boolean expression below can be simplified as two variables and AND gate. [15 Marks] Q = A.B.(B+C) +B.C+((B+C)+A) Question 2 [15 Marks] Using the Karnaugh map, find the most simplified Boolean Expression of output Z. Show process steps and your work clearly. B D 0 1 0 1 A 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 1 0 0 1 1 0 0 1 1 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 0 1 Z 1 0 1 0 0 0 0 1 1 0 1 0 1 1 1 0 0 1 0 1 0 1 1 0 0 1 1 1 1 1 1 0 1 Question 3: Design of a comparison logic circuit: We have two bit binary number A (A1A) and two bit binary number B (BiBo) as inputs. One bit X and one bit Y. The working principle of the comparison circuit is as follows [40 Marks): If 0 2, then Y = 1, otherwise Y=0 Note: (0+1)%5=1 Find the simplified Boolean Expressions of X and Y using truth table and Karnaugh Maps. Question 4: Design of Parallel Subtraction Block Diagram (30 Marks] a) Using 2's complement method subtract four bit binary number A (A3A2A1A) from four bit binary number B (B;B_B_BO) and show the parallel block diagram of the logic circuit (i.e. B-A). b) On the block diagram show the subtraction of B(0001) and A(1010) and binary numbers. If the outcome is negative, you need to expand the block diagram so that it finds the correct