Draw an automaton which will accept all integers (in binary form) of Odd parity (number of 1s in the string is odd). Now write a code in a high level language (C++ or Java or ??) for the automaton. Take inputs of two strings, one of odd parity (e.g, 00111011) and another one of even parity (e.g., 1100110011). Your code should accept the right string and reject the wrong one. Print your code and results.