4. Consider the following automaton. 11 points a) Give an example of a string containing 11 that is accepted by the following automaton. [2 marks] b) Give an example of a string of length 8 that is rejected by the following automaton. [2 marks] c) Describe the language of this automaton in plain English. [4 marks] d) Describe the language of this automaton using Regular expression. [3 marks] 1 1 A D -- 0,1 0