Word process all answers (figures and tables may be hand drawn), show work for partial credit Make sure your name appears at the top of the assignment. Answer 10 ofthe 1 questions. Answer ll 1 for extra credit. 1 ) Construct a truth table for each of the following Boolean expressions. than+ + is applied before XOR). has lower precedence a. A+B+A B+C 2 Simplify the following Boolean statements using the identities on page 141. You do not need to specify which identities you are using, but show each simplification as demonstrated in the PowerPoint notes. b. (A +B) A+A B C+CA+ B+ C) 3) Prove the following two expressions are equal by simplifying one to the other (do not solve this by showing they have the same truth table results) 4) Given the Boolean expressions F-x and G-x +y. , show F.G-F to prove that DeMorgan's Law holds for F and G (note: you will have to apply DeMorgan's Law in your solution, use Boolean simplification, not truth tables to demonstrate this). Solve this problem by deriving F, G, F G, F G, and F +G. When done, your result for F G should equal F+ G 5) Draw the circuits for the unsimplified expressions in number I 6) The following truth table represents an important computation that I would like implemented in hardware. Come up with the Boolean expression for the function using sum of products and then draw the circuit. If you can simplify the expression first and draw a reduced circuit you will receive extra credit. XY Z Function 0 0 0 0 1 0 1 01 1 1 0 0