this is computer organization and architecture

4. Simplify the following Boolean functions: a. F-AB+ BC + B'C b. F= A + AB c. F= A'B'C + A'BC + AB' d. F= AB + (AC)' + AB'C(AB + C) e. F= ((XY' + XYZ)' + X(Y + XY'))' 5. Obtain the sum of product form of the following functions using Minterms: a. F(A, B, C) = A + BC b. F(A, B, C, D = AB + ACD 6. Obtain the product of sums form of the following functions using Maxterms: a. F(A, B, C) = A + B'C 7. Find the complement of each of the functions by applying DeMorgan's theorem as many times, as necessary: a. F1 = X'YZ'+X'Y'Z b. F2 = X(Y'Z' + YZ) 8. Simplify the following expression using Boolean algebra: a. A'BC + AB'C + ABC + ABC b. (A + B' + B (A' + AC + ABC for the miven Boolean expressions