Answer the following questions: a) Write a regular expression that accepts the language of all binary strings not ending in 10 [4 marks] b) Design an automaton with at most 3 states that accepts the language of all binary strings not ending in 10 [4 marks] c) Write a regular expression that accepts the language of all binary strings with no occurrences of 110 [4 marks] d) Design an automaton with at most 4 states that accepts the language of all binary strings with no occurrences of 110 [4 marks]