1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 HOOOO 1 0 0 0 roor ro HOHOHOHO 0 1 1 1 1 1 1 1 1 OOOOOO 1 0 0 1 1 0 0 1 1 1 1 1 1 1 ROHOROHO 1 1 1 1 1 1 1 1 2. Simplify the following Boolean equations using Boolean theorems. You can check for correctness using a truth table or K-map. a. Y = ABC + ABC b. Z = WXY + WX c. T = PQRS + PQRS + PQRS 3. Write the Boolean Equations for the circuit below. You don't have to minimize the equations A B C D YYYTY