3. Consider the Boolean expression F(A,B,C) = ABC' + AB'C + B'C.+ a. Draw a gate-level circuit diagram for the logic circuit that computes F(A,B,C) and containing only gates that implement one of the three Boolean algebra operations. Use gates with more than two inputs when this will make the circuit simpler. Abstract out NOT gates for inputs by labeling an input X' as needed. + 4 b. Draw a gate-level diagram containing only NAND gates for a logic circuit computing F(A,B,C). Use gates with more than two inputs when this will make the circuit simpler. + 4 4. By fixing one input of a two input NAND gate to always receive a logic 1 the gate then functions to invert the logic value sent to the free input. Is there a 2-input function that can invert a free input when the other input is held to logic 1 and also not invert the free input when the other input is held to logic 0? If this function has a name, what is it? Otherwise answer "no name." +