Simplify the following Boolean expressions to a minimum number of literals: Question Example 1. Any Boolean function that has 2 inputs and at least 2 terms. F(x,y) = xy+x'y 2. Any Boolean function that has 3 F(x,y,z) = xyz'+x'yz + xyz +x'z inputs and at least 4 terms. inputs and at least 6 terms. 3. Any Boolean function that has 4 F(x,y,z,w) = xyz'w'+x'y'zw+xyw+x'zw+y'zw+ xyw' Q2. Find the truth table for the Boolean function that you write them in Q1, before and after simplification.