4) 20 points. For the above logic (you can start with any of the above implementations, because they're all logical anual create a truth table and K-map. Solve for a minimal sum of products expression. 0 0 0 0 Blclor 0 0 0 0 0 1 0 1 0 0 1 1 - - - - - - - - - - - - - O - - O - - 1 1 1 5) 5 points Based on your SOP expression (or, if needed, create a mixed-logic schematic and solve appropriately), how many Rates would be needed for a NAND (and inverters) implementation? 2-input NANDs: 3-input NANDs: 4-input NANDs: Inverters: 1) 20 points. Manipulate the following Boolean expression to remove all "big bars"; l.eonly input signals may be inverted, Stop as soon as all big bars are gone, don't keep trying to manipulate it algebraically after that point Y = (+B+B.D)-(A + + D) = (a + b + B.D)+(A + C + D) = DD + Ate o Y = A.B. (oto) + (Ate).D 2) 20 points. For the expression above before your manipulation), draw a mixed-logic schematic and convert it to a physical implementation using only NANDs and inverters. Don't forget to leave room to draw bubbles and inverters as you manipulate it. b (A-B-BD)-(A. c.D) . AC D A Dont Doc Dokic - Ate too). (Ate) :D = (ato + B.D) (Ate ) HD)