1. Construct a truth table for the following: a. out x'yz +(xyz)' b. out (x+z')(x+y')(y+z) 2. Simplify the following functional expressions using Boolean algebra and its identities. List the identity used at each step. a. (ab+c+df)*ef b. x+xy c. (xy'+x'z)(wx+yz') 3. The truth table for a Boolean expression is shown below. Write the Boolean expression in sum-of-products form. F 0 0 0 1 1 0 0 1 1 0 0 1 1 0 4. Draw the combinational circuit that directly implements the following Boolean expression: F(x,y,z)=xz+(xy +z') 5. You could draw the digital diagram either by Visio (Analog and Digital Logic) or by hand and scan to submit. Assume you have the following truth tables for functions F1(x,y,z) and F2(x,y,z)