In the following two questions, two approaches to construct a comparator for two 8-bit unsigned integers in binary are investigated. Assume that AND gates, OR gates, NAND gates, NOR gates, XOR gates and XNOR gates of any number of inputs and NOT gates can be used. Assume that all gates are implemented as CMOS circuits. Assume 2-input XOR gate and 2-input XNOR gate are implemented using 8 transistors. 1. (40 points) Consider extending the idea of the comparator circuit in Fig. 4.22 from 4 bits to 8 bits. (You do not need to draw the circuit diagram.) (a) (30 points) List the gates with the number of inputs required for the 8-bit comparator. For example, for the 4-bit comparator shown in Fig. 4.22, the answer would be: Four 2-input XNOR gates, Four NOT gates, One 2-input AND gate, One 3-input AND gate, Two 4-input AND gates, One 5-input AND gate, One 4-input OR gate, One 2-input NOR gate [Remark: In practice, basic gates with more than 3 or 4 inputs would be too slow to use. Hence they would be broken down into several gates with fewer inputs.J (10 points) How many transistors are required to implement the 8-bit comparator with this approach? (b)