Circuit problem

4. Little Susie is building a dog-training robots she calls CESAR (Canine Education Special Assistant Robot). Currently, she is working on the robot unit that will award treats when training puppies. First she needs to figure out when a puppy should get dog biscuit as a reward; then she can build the appropriate circuit for the robot. She has concluded the following: • Give the puppy a biscuit if it sits and wiggles but does not bark. • Give the puppy a biscuit if it bars and wiggles but does not sit. • Give the puppy a biscuit if it sits but does not wiggle or bark. • Give the puppy a biscuit if it sits, wiggles and barks. • Don't give the puppy a biscuit otherwise. Assume the following variables and values: • S: Sit (0 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 poppy a biscuit) Construct a truth table, find a minimized Boolean function to implement the logic telling CESAR when to give puppies treats as training rewards. Then draw the logic diagram. For this problem implement the Boolean functions you found two ways: 1) using NOT, AND, and OR logic gates; and 2) only NAND gates;