Consider the Boolean expression E(ABC) = ABC' + AB,C + BC a. Draw a gate-level circuit diagram for the logic circuit that computes FA,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. Draw a gate-level diagram containing only NAND gates for a logic circuit computing E(AB,C). Use gates with more than two inputs when this will make the circuit simpler. b