Design a sequential circuit that counts the number of 1's in a binary string of n-bits. The obvious but inefficient approach would be to examine each bit and increment a counter if a 1 is encountered. This will take n cycles. However, your design should determine the count (output) in the number of clock cycles equal to the number of 1s in the string. For example, for the string "1100110", it should take 4 clock cycles. Similarly, for "110000100000100" it should take four clock cycles. Construct the ASM chart for the controller of the circuit. All the n bits of the input binary string are available at once (no serial input) to the circuit when an input START is asserted. When the START signal = 0, the circuit is in READY state waiting for the input binary string. After generating the output, the circuit goes back to the READY state waiting for START input to be asserted. Clearly describe and draw what the components of the datapath must be and the function of the other outputs (to control the datapath) of the controller. There are two states in total in the controller.