Consider the following automaton. - a) Give an example of a string that is accepted by this automaton. b) Give an example of a string that is rejected by this automaton. c) Describe the language of this automaton. a) Give an example of a string in the language of (0*10'). b) Give an example of a string that is not in the language of (0*10+)+. c) Design a regular expression that accepts the language of all binary strings with exactly one occurrence of aa