solve 1, 2, 3 please

Lab2_Simplification of Boolean Functions using Boolean Algebra 2 -Saved to my Mac Layout References Mailings Review View able Design Layout AaBbCcDc AaBbCcDdE Subtitle No Spacing Heading 1 A A Aa A AUT AaBbCcDdE AaBb CcI AaBbCcDDE ADAQ Heading 2 Normal 1. Using Boolean algebra, simplify the following expressions. SN 74UUN 7645 F = ABC + (A + B + 7) + ABCD F = ABCD + AB (CD) + (ABCD F3 = XYZ + XYZ + WXY + WXY + WXY F4 = A + B[C+ D(B+ ] Figure 1 7400 NAND DIP a. Build the Truth Table for F and F4 functions. b. Draw the circuit diagram for both unsimplified and simplified equations of F2 and F3 c. How many 7404, 7408, and 7432 chips do you need to implement the simplified and unsimplified circuits of F1, F2, F3 and F4? 2. Design Problem: Consider four chairs A, B, C, and D placed in a row. Each chair may be occupied ("1") or empty (O). A Boolean output function (F) is l" if and only if there are two or more adjacent chairs that are empty. a. Give the truth table defining the Boolean function (F). b. Write the logic equation for (F). c. Using theorems of Boolean algebra, simplify (F). 3. Design a logic circuit to produce HIGH output only if the input, represented by a 4-bit binary number, is greater than twelve or less than three. a. Build the Truth Table b. Simplify your equation c. Draw the simplified equation O Focus English (United States) B MacBook Pro IT 2 Y DUO ITO TIP Nu Yo G H I K T