Digital Logic

2. Simplify the logical expressions algebraically (Use laws and properties of Boolean algebra) a. C+ BC d. AB(A + B)(B+B) b. (A+B)(A + B) e. (A + C)(AD + AD) + AC + C C. ABC + AB f. A(A + BC) +A(B+C) 3. Construct the operation called A using only the AND, OR and NOT gates which will produce the following outputs on the right. At the end simplify the function algebraically if possible: a. F(A,B) = { 00, 01, 10, 11 => 1, 1, 1, 0} b. F(A,B) { 00, 01, 10, 11 => 1, 0, 1, 1 } c. F(A,B) - 00, 01, 10, 11 -> 1, 0, 0, 1) = 4. Express each of the following functions using only AND, OR and NOT gates (Do not simplify) a. F(A,B) = AB + AB c. F(A,B) = A + B(B + A) b. F(A,B) = (A + B)(B+ A) d. F(A, B, C) = B(A + C)