* Counting 1's binary string; file is shown as picture

3 Counting 1's in binary strings When it comes to computers, counting things is a common problem. Systems like linters (code analysis that flags potential problems) also use something similar to a state machine. For this problem, we will design a system that will read a binary string, and output true if the number of 'T' bits it contains is a multiple of four. For instance: input result 01 0. 1001 011 1101 1100 1111 1000 0111 1000 0 Now, download the file binary-count-starter.circ and build a circuit that implements the DFA according to the speilfications outlined ahowe ingut toco r Oaccepting