3.26 E ONLY E FOR BOTH 3.26

3.25. Implement the following logic equations for Z. basing the implementations on the positive- logic convention. Assume that only the following gates are available: 74'00. 74'02. 74'04. 74'10. and 74'27. Also, for each implementation use a minimum number of gates and draw the circuit diagram with all gates labeled. (a) Z = AB + C + ABD for Z.H. The inputs are A.H. B.H, C.H, and D.L. (6) Z = (A + DA + C + DXC + D) for Z.H. The inputs are A.H. B.L. C.H. and D.H. (c) Z = AB + CD + CD for Z.H. The inputs are A.L, B.H. C.H. and D.L. (d) Z = (A + D)(B+C)(B+C) for Z.H. The inputs are A.H. B.L.C.H. D.H. and D.L. (e) Z = AC + BD + BD for Z.L. The inputs are A.L.B.L.C.H. and D.H. (1) Z = AC + BD + CD for Z.L. The inputs are A.L. B.L. C.H. and D.L. 3.26. Repeat Problem 3.25 for implementations based on the mixed-logic convention