Use the following: 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 puppy a biscuit) Construct a truth table and find the minimized Boolean function to implement the logic telling John when to give his dog a biscuit. If F(w,x,y,z) = w'x'y'z' + w'z + w'x'yz' + w'xy'z' + wx'y a) Create the Kmaps and then simplify F(w,x,y,z) (leave in sum-of-products form). b) After simplifying F(w,x,y,z) draw the combinational circuit that directly implements the Boolean expression.