1) bit For fi(x1,X2,X3,X4,Xxs), f2(x1,X2,X3,X4,Xs) and f3(x1,X2,X3,X4,Xs) functions where xi is the most significant a) If...

Transcribed Image Text:

1) bit For fi(x1,X2,X3,X4,Xxs), f2(x1,X2,X3,X4,Xs) and f3(x1,X2,X3,X4,Xs) functions where xi is the most significant a) If fi(x1,X2,X3,X4,X5) = (x4Oxs)'+xıx2x3'+xı'x2x3'x4'xs draw the Karnaugh map for the function and write down the optimum sum of product representation. b) Iff=Em(6,7,8,9,23,24,28,31), fi is the Boolean function from part (a) and f3-f2@fi, draw the Karnaugh map for få function and write down the optimum product of sum representation. 1) bit For fi(x1,X2,X3,X4,Xxs), f2(x1,X2,X3,X4,Xs) and f3(x1,X2,X3,X4,Xs) functions where xi is the most significant a) If fi(x1,X2,X3,X4,X5) = (x4Oxs)'+xıx2x3'+xı'x2x3'x4'xs draw the Karnaugh map for the function and write down the optimum sum of product representation. b) Iff=Em(6,7,8,9,23,24,28,31), fi is the Boolean function from part (a) and f3-f2@fi, draw the Karnaugh map for få function and write down the optimum product of sum representation.