P4. (12 pts) Consider the digital Boolean function Y=F(A,B,C,D) specified in the following truth table. a) (8 pts) Draw a K-map based on the truth table, and then use the K-maps method to find the minimized Boolean equation of Y=F(A,B,C,D). b) (4 pts) Does the minimized circuit have any glitch when one input changes and the other three inputs remain unchanged? If so, explain when the glitch can happen, i.e., you need to explicitly say which inputs remain unchanged (and what values they should be), and which input needs to be changed (and it changes from what value to what other value?). A B D Y 0 Ooo 0 X 0 1 0 oooo 0 1 0 X 0 1 1 0 0 1 0 0 X 0 1 0 1 0 0 1 1 0 X 0 1 1 1 1 0 1 0 0 0 1 0 0 1 X 1 0 1 0 1 0 1 1 0 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1