Please see the below example. Questions: Consider the following expression: Y=AB+C. Implement this Boolean Expression using NAND gates. Solution: HY=AA3+C Consider output from Figure 2 . Y=ABCApplyDe-Morganslaws.Y=AB+Csince(A=A)=AB+C So, the Boolean Expression Y=AB+C is implemented using NAND gate in Figure 2, also it's output is verified by simplifying it. Now solve the below problem please: Consider the following Truth Table where A,B is input and Y is output. a) Write the Boolean expression from this above truth table. b) Draw the corresponding logic diagram using AOI gates. c) Draw the corresponding logic diagram using NAND gates. d) Also verify that the output from this NAND gate implementation is same as the Boolean expression that you obtained from the truth table