Two binary numbers A and B are to be added. A is a $4-$bit number $($A$3$A$2$A$1$A$0)$ and B is a $3-$bit number $($B$2$B$1$B$0).$ Both A and B are unsigned numbers. Result of addition is another binary number X$.$ Further the design is to be a ripple carry adder circuit for adding A with B$,$ using only Full adders $($FAs$)$ and Half adders $($HAs$)($number of FAs and HAs are to be chosen such that the total gate count of the final design is minimum$).$

Full adder and Half adder circuits designed should have each used only a total minimum number of gates chosen from among the following list of gates. $($Two input AND gates; two input XOR gates; NOT gates; $2$ Input OR gates and $3$ input OR gates$)$

Using the above information, answer the following questions:

For the above design answer the following questions.

Q$1.$ Total minimum number of bits in result X will be: $\_\_\_\_\_\_\_\_\_\_\_\_$

Q$2.$ Total number of Full adders used in design are $\_\_\_\_\_\_\_\_\_\_\_\_$

Q$3.$ In all total number of gates used in the design are: $\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Q$4.$ Total number of XOR gates used in the design are: $\_\_\_\_\_\_\_\_\_\_\_$

Q$5.$ Total number of OR gates used in the design are: $\_\_\_\_\_\_\_\_\_\_\_$