work like half-adder, (> work like a half-subtra = two bits, x and y, acco ns and logic diagram.

Draw a logic diagram that implements the Boolean expression of ((x'+y)y)'.

How do I write C code and test this for this state diagram?

་ For the 4-input truth table shown in the figure below, find the following: a. Give the canonical sum of products (SOP) logic expression as a sum of minterms. b. Give the canonical sum of products (SOP) logic circuit diagram. c. Give the minterm list Σ. d. Give the canonical product of sums (POS) logic expression as a product of maxterms. e. Give the canonical product of sums (POS) logic circuit diagram. f. Give the maxterm list. ABC DIF 00001 0 0 0 1 0 0 0 1 0 1 0 0 1 1 1 01001 0 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 0 0 0 1 100 10 10 10 1 101 10 1 1 0 0 1 1 1 0 1 1 1 1 0 1111 0 1 1