Simplify the following Boolean function F(A,B,C,D)= Ʃ (4, 6, 8, 10, 11, 12, 15) as product of sum form also take advantage of  don’t-care conditions d (A,B,C,D)= D(3, 5, 7, 9)and draw its two-level implementation diagram

3. The following figure shows the four-bit Adder-Subtractor. Your inputs for this combinational circuit are A = 8, B = 5 and M = 1. What is the outputs S3, S2, S1, and S0? You have to show how to get the outputs by indicating each carry bit. (Note: You should show all the steps to receive full credits)

Can you reduce this boolean equation down to 3 IC's?

Simplify function F, with don't care conditions d given below, into a Product-of-Sums form. Show all work. F (A, B, C, D) = 2(2, 4, 7,10, 12) d(A, B, C, D) = L3,9,11, 15)