2. Let's consider the following 2:1 Multiplexer that selects between ane of the N inputs to connect to output. Can you write its simplified equation using K-Map? Can you also draw the logical schema (use the simplified equation, that way it's much easier to draw a schema*) 3. Generalizing a multiplexer to N:1 mux, how many seleet bits would you need? 4. Could I use a multiplexer as an AND or OR logic gate? How would you do it? "In fact the point of simplifying is to be able to build an "easier", "simplet" circuit! 5. A decoder (instead) has N inputs and 2v outputs. It asserts exactly one of its output depending oe the input. Can you draw the logic gates to achicve this? ( use 4 AND and 2 NOT eaten.) 6. Give an example of a truth table that requires between 3 billion and 5 billion rows that can be constructed using fewer than 40 two-input gates. 7. Build a circuit with a cyclic path that is still combinational. What about its behavior? 8. Steve Womiak hates programming in a parage that has no tooks. He aloo enjoys programming any time after a coffee as well as during nighr and he is not tired. Write a Brolean equation for his programining activity. P in terms of G (garage), tools (O),C (Coffee). N (Night) and T (tiredy. 9. A Circuit has 4 inputs and 2 outputs. The inputs represent number from 0 to is. Output P should be TRUE if the number is prime. Output D should be TRUE is the number is divisible by 3. Give a Simplified Boolean equation (use K-Map) and sketch the circuit