Design a DFA that accepts any binary string w, such that: 1) w has a length of exactly 4. 2) The number of 1 's is greater than the number of 0 's. for example: 1011,0111 will be accepted while 0101,1100,111 and 11111 will be rejected -Don't use more than 8 states -The trap state can be omitted to simplify your design