Problem 3. Consider the following truth table which defines two functions F and G of three input variables (A, B, and C). A В C F G AB 1 1 1 1 0. 1. 1 1 1 AB 1 1 1 1 1 1 1 1 1 1 1 1 Give the minimal...

Extracted text: Problem 3. Consider the following truth table which defines two functions F and G of three input variables (A, B, and C). A В C F G AB 1 1 1 1 0. 1. 1 1 1 AB 1 1 1 1 1 1 1 1 1 1 1 1 Give the minimal sum of products (minimal SOP) logic equation for each of the two functions. Then determine if the minimum sum of products expression would result in a lenient implementation of the function. If it does, then enter "SAME" for the lenient SOP expression. If not, specify what sum of products expression would result in a lenient implementation. Hint: Use Karnaugh maps above to determine the minimal sum of products. Minimal sum of products F(A,B,C) =D Does minimal SOP for F result in a lenient circuit (circle one)? Yes No If “No", give lenient SOP expression for F(A,B,C) = Minimal sum of products G(A,B,C) =, Does minimal SOP for G result in a lenient circuit (circle one)? Yes No If "No", give lenient SOP expression for G(A,B,C) =, 6.004 Worksheet - 3 of 10 - Combinational Logic