1. You are given the following truth table. A B C D X Y Z 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 1 01 1 1 0 1 0 0 0 0 1 0 1 0 1 1 0 1 1 0 0 0 0 0 1 1 0 1 0 1 0 1 1 1 0 01 0 0 1 1 0 1 0 0 1 () [5X 3] Obtain the K-maps and logic functions for X, Y and Z (please note that there might be "do not care" combinations). (ii) [5 Draw the logic circuit. 2. (i) 5] Give the truth table of a full adder and find the functions for sum and carry. (ii) [5] Draw the full adder circuit and indicate that there are two half-adders in the circuit. (ili) [5] Give the truth table of a half-subtractor and find the functions for difference and borrow in terms of min-terms. (iv) [5] Use a 2-to-4 line decoder and OR gates to implement the half-subtractor circuit. 3. You are given the following state table Present State Output Next State 0 0 0 0 0 (i)5] Draw the state diagram. (ii) [8] By using K-maps, find the functions for X, Y, B(t+1) and C(t+1) (ii) [7] Draw the sequential circuit (You need to consider D flip-flops as memory unit)