Problem $2$

Consider the following truth table which defines two functions F and G of three input variables

$($A$,$ B$,$ and C$).$

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)=$

Minimal sum of products $G(A,B,C)=$