Simplify the following Boolean functions, using four- variable maps: (a) w'z + xz +x’y + wx'z (b) B’D +A'BC' + AB’C + ABC' (c) AB'C+ B'’C’D'+BCD + ACD'+A’B’C+A°BC’D (d) wxy + yz +xy'z +x'y

36. Convert the Boolean expression A(BC+ DE) to SOP form. a. ABC + ADE b. ABCDE c. A + BCDE d. ABC + DE

Write the simplified Boolean expression Draw the circuit diagram Implement your function using 1 MUX(4x1) plus additional gates  0 1 2 3 4 5 6 7  8 9 10 11 12 13 14 15 0=1 2=0 1=x 3=1  4=1 5=1 6=0 7=1 8=x 9=x 10=0 11=0 12=0 13=x 14=1 15=x

Using algebric manipulation minimize the following boolean function