1. Construct a truth table for the Boolean equation below:

M = A'BC + AB C + A BC + A BC + A B C

A	B	C	M
0	0	0
1	1	1

2. Draw a simple NOT, AND, OR circuit in sum of product (SOP) form that represents the equation in problem 1.

3. The truth table for a Boolean expression is shown below. Write the Boolean equation in SOP form

x	y	z	F
0	0	0	1
0	0	1	1
0	1	0	0
0	1	1	0
1	0	0	1
1	0	1	1
1	1	0	1
1	1	1	0

5. Describe the differences between a half-adder and a full-adder;

Identify the types and quantity of gates needed to implement each type of adder circuit;

either create (or give the location in the text) of a logic diagram of each of the adder circuits.