Say we want a boolean expression for this table: B F 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1 We could use the sum of products technique, but since there are five l's and three O's, we might prefer to use our new technique product of sums-namely (A+B+C)(A+B+C)(A+B+C). CS 1400 Spring 2021 Page 4.12 Chapter molen Al February 11, 2021 Example Write down the truth tables (digital function charts by a common name) for AB and apply both techniques (sum of products and product of sums) to get two different boolean expressions for AB. Simplify the results. Do the same thing for A+B. Exercise 9 [2 points] (target due date: end of Week 5) Write down a boolean expression equivalent to this digital function, in the form of a product of sums: A B F 0 0 0 1 0 0 1 0 0 1 0 1 1 1 0 1 1 0 0 1 1 1 1 0 1 0 1 1 1 1 1 0 Exercise 9 (2 points] (target due date: end of Week 5) Write down a boolean expression equivalent to this digital function, in the form of a product of sums: A F B 0 0 0 0 1 0 1 0 0 0 1 1 0 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 0