P4 (10 points): We need a circuit with seven inputs and four outputs that operates in accordance with the following abbreviated truth table: Show how this truth table can be implemented with just three 4-1 MUXes. P5 (10 points): A 6-bit 2-1 MUX has a 1-bit select input S, one 6-bit data input A, one 6-bit data input B, and one 6-bit data output F. Otherwise it functions like a regular 1-bit 2-1 MUX except that the data lines are 6 bits wide: A: What is the fewest number of 1-bit 2-1MUXes that one can use to produce a 6-bit 2-1 MUX? B: What is the fewest number of 1-bit 2-1 MUXes that one can use to produce a 1-bit 8-1 MUX? C: What is the fewest number of 1-bit 2-1 MUXes that one can use to produce a 6-bit 8-1 MUX? D: What is the fewest number of 1-bit 2-1 MUXes that one can use to produce an n-bit m-1 MUX? P6 (10 points): Given a large supply of 1-2 decoders (with enable), show h 2-4 decoder. ow you can create a P7 (14 points): Using the specified decoder(s), implement the following: A: One NOT gate using only one 1-2 decoder. B: One 3-input AND gate using only two 1-2 decoders. C: One 2-input OR gate using only four 1-2 decoders. D: One 2-input NOR gate using only one 2-4 decoder. P8 (20 points): Given Z(a, b,c) - 2m(2,3,4,6,7), implement function Z using only the following components: A: One 3-to-8 decoder and one 6-input OR gate. B: One 3-to-8 decoder and one 16-to-4 encoder. C: One 4-2 priority encoder. D: One 3-to-8 decoder and one 8-to-3 binary encoder