1) For the function F-A'B'C'D+AB'CD+A'B'CD+ABCD+A'BC'D+ABC'D Find the minimum SOP using Boolean properties, state the properties used for each step Now add the term ABD to your simplified function from problem 1). Does this change when the function is 0 or 1? If not why not? You should prove this by siting a property and showing specifically that this term is redundant in this function. Find the minimum POS for this function. To do this first build a truth table, and then add the column F. Find canonical sum for F. Remember that is just the sum of the minterms. Then take the compliment of both sides of this expression. This will give a Pos form of the function F. This should be a canonical product Find the minimum POS for the function in 3) using Boolean operations. Site the property used for each key step. 2) 3) 4) S) Multiply (A+B'+C) by your function in 4).Doesthi change when the function is 0 or 1? If not why not? You should prove this by siting a property and showing specifically that this term is redundant in this function