I have provided below 5 truth tables, each of which contain anywhere from 2 to 4 inputs (A-D) and one output Y.

(b) (c) (e) B 1 0 1 Y 1 0 1 1 A 0 0 0 0 1 1 1 1 B 0 0 0 1 1 0 1 1 0 0 0 1 1 o 1 1 Y 1 0 0 0 0 0 0 1 A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 Y 1 0 1 0 1 1 0 1 Y 1 0 0 1 0 1 (d) A B 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 1 D 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 Y 1 1 1 1 0 0 0 0 1 0 1 0 0 0 1 0 A 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 B 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 D 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 0 0 1 1 0 0 0 1 For each truth table (a-e) you will receive the following extra credit points: +1 pt for producing a correct and simplified Boolean expression +1 pt for drawing a correct digital circuit (using two-input AND, OR and NOT gates) Please show all work, particularly in the simplification. You can use Boolean Algebra and/or a Karnaugh Map -- though just a reminder - the Karnaugh Map will only do the DCI (Distributive, Complement, Identity) properties and it is possible you can go further