(100 points) Given a 3-input function F(A, B, C)- m (1,4,5,6,7). Assume that AND gates and OR gates of any number of inputs and NOT gates can be used. Let the cost of a logic circuit be the total number of gates plus the total number of inputs to all gates in the circuit. Show your steps in the following questions (a) (20 points) Implement F using one 3-to-8 decoder without enable and a minimal number of l. basic gates. Assume the decoder is implemented using the idea in Fig. 4.13 but extended to a 3-to-8 decoder. What is the total cost of your implementation (including the gates inside the decoder)? (20 points) Implement F directly as a simplified SOP expression. What is the total cost of your implementation? (20 points) Implement F using one 2-to-1 MUX and a minimal number of basic gates Assume the MUX is implemented as in Fig. 4.1. What is the total cost of your implementation (including the gates inside the MUX)? In this question, you should minimize the cost of your implementation by determining the best input to be used as the select input to the MUX (20 points) Implement F using one 4-to-1 MUX and a minimal number of basic gates Assume the MUX is implemented as in Fig. 4.2. What is the total cost of your implementation (including the gates inside the MUX)? In this question, you should minimize the cost of your implementation by determining the best inputs to be used as the select inputs to the MUX (20 points) Implement F using one 8-to-1 MUX and a minimal number of basic gates Assume the MUX is implemented using the idea in Fig. 4.1 and Fig. 4.2 but extend to a 8-to-1 MUX. What is the total cost of your implementation (including the gates inside the MUX)? (b) (c) (d) (e)