What is the minimum number of full-adders and half-adders that are needed to count the total number of ones in an unsigned 7-bit binary number A6A5A4A3A2A1A0? You are allowed to use only full-adders and half-adders in your solution. . Draw the corresponding circuit diagram in Logisim and test it. For this you are allowed to use the built in adder module in logism-evolution, i.e., you dont have to first build an adder from simpler gates.

(If Logism isn't possible, please draw)