Principles of Computer Architecture

4. a. C. e. Little Susie is trying to train her new puppy. She is trying to figure out when the pupph should get a dog biscuit as a reward. She has concluded the following: Give the puppy a biscuit if it sits and wiggles but does not bark. b. Give the puppy a biscuit if it barks and wiggles but does not sit. Give the puppy a biscuit if it sits but does not wiggle or bark d. Give the puppy a biscuit if it sits wiggles, and barks. Don't give puppy a treat otherwise. Use the following: S: Sit (0 for not sitting; 1 for wiggling) W: (Wiggles (0 for not wiggling; 1 for wiggling) B: Barking (O 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 dog a biscuit