0 0 0 0 1 1 0 + 0 1 1 o + D 1 1 1 0 w the logic magram for the imported express a pare 28. Construct the XOR operator wing only AND, OR, and NOT 37. Find the truth able that describes the following circut I. Ghete the De Che for hun ppy cute te po C 14a 17b 23 28 37 47 53 17. Simplify the following functional expressions using Boolean algebra and its identities List the identity used at each step. a) x(y + z(x' + z') b) xy + xyz + xy'z + x'y'z 23. The truth table for a Boolean expression is shown below. Write the Boolean expres- sion in sum-of-products form. z 0 F 1 0 0 0 0 1 1 0 1 1 0 0 1 1 0 1 0 1 1 1 0 1 0 0 0 1 1 e) Draw the logic diagram for the simplified expression in part e. 28. Construct the XOR operator using only AND, OR, and NOT gates. 29. Construct the VOD anarator naine anl. AN 37. Find the truth table that describes the following circuit: y- Z- xD 47. Little Susie is trying to train her new puppy. She is trying to figure out when the pure should get a dog biscuit as a reward. She has concluded the 1. Give the puppy a biscuit if it sits and wiggles but does not bark. 2. Give the puppy a biscuit if it barks and wiggles but does not sit. 3. Give the puppy a biscuit if it sits but does not wiggle or bark. 4. Give the puppy a biscuit if it sits, wiggles, and barks. 5. Don't give the puppy a treat otherwise. Use the following: S: Sit (O for not sitting: 1 for sitting) W: Wiggles (0 for not wiggling; 1 for wiggling) B: Barking (0 for not barking; 1 for barking) F: Biscuit function (0, don't give the puppy a biscuit; 1, give the puppy a biscuit) Construct a truth table and find the minimized Boolean function to implement the logic telling Susie when to give her dean hiei 53. Complete the truth table for the following sequential circuit: A B A B OOOO 1 1 OOOO D C KQ 1 Q 1 0 1 1 1 1 1