CP213 - Winter 2021 Lab 2: Boolean Algebra and Logic Gates Problem 2: Suppose the truth table of a Boolean function F is given by: 0001 001 1 0 1 0 0 0 1 1 1 1 0 0 1 0 1 0 1|1|0|| 1 111 0 (a) Express F as a sum of minterms. Simulate your result, and verify that it has the same outputs, depending on the values of x, y, and 2. Include a screenshot of your implementation and list its truth table in your report (b) Express F as a product of maxterms. Simulate your result, and verify that it has the same outputs, depending on the values of r, y, and z. Include a screenshot of your implementation and list its truth table in your report. Problem 3: (a) Implement and simulate the circuit described by the logic diagram below. Write Boolean expression describing its outputs. Include a screenshot of your implementation in your report. a Blon (b) Use Boolean algebra postulates and theorems to simplify to a minimum number of literals. F = (x' +')(+y+z) Make sure to clearly state the postulate or the theorem used for each step. Problem 4: Consider the Boolean function F given by F=A+CD+(A+D)(B'+D) (a) Convert F into sum of products. Explain clearly how you obtained your result. Simulate your result, and include a screenshot of your implementation in your report. (b) Convert F into product of sum. Explain clearly how you obtained your result. Simulate your result, and include a screenshot of your implementation in your report