3 Boolean Algebra (10 marks) Done on pages Assume that F is a Boolean function, as defined below, and all the other Boolean variables are inputs. Derive and give: i. The truth table, ii. A sum of products expression for F that is minimized. iii. A product of sums expression that F is minimized. By "minimized" we mean an expression that cannot be further simplified while retaining its form (sum of products or product of sums) (a) F(A, B,C, D- (A+ B- D) - (C B. A+C. D) (b) F(W, X, Y, Z) (W +X)(ZY + X)