Please show work so I can understand the process

3. Complete the truth table below for the following circuit. List the values in order, i.e., from 0 to the maximum number. (24 points) X Y Z DoM Da 1, x line A HALE ADDER B S 0 0 0 0 1 1 1 1 Y 0 0 1 1 0 0 1 1 Z 0 1 0 1 0 1 0 1 4(a) Write a Boolean expression in sum of product form for the following truth table. (10 points) A B Output 0 0 0 0 1 0 0 0 1 lo 0 1 1 0 1 0 0 1 1 0 0 0 1 1 0 1 1 1 1 0 1 1 4(b) Implement a logic circuit diagram, using AND, OR gates, for the function represented in the truth table in 4(a). (10 points) 4(e) Implement a logic circuit diagram, using only NAND gates, for the function represented in the truth table in 4(a). (10 points) 5. Simplify the following Boolean expressions using Boolean algebra properties. (7 + 7 points) A. (A +C)(AD + AD) + AC + C B. B C + ABC + ABC