Write a program in your favorite programming language (Python, C, C++, etc.) to implement/simulate a finite automaton that (only) recognizes/accepts the language of: Problem A Binary numbers {00000000, 0101, 111111, etc.} Your Finite Automaton Definition Final states: Q = {..} Input alphabet: E = {...} Transition function Graph representation Table representation Start state: Final State(s): F = {.} Graphical representation of your automaton Table repreentation of your automaton Page 4 Algorithm: flowchart, pseudo code, . Data structures: area, list, string, dictionary, . Explanations - Discussion - Assumptions (if any) Page 5 Test example 1 Input data: string-1 Output data: accepted Test example 2 Input data: string-2 Output data: rejected