For this question, remember that a language is a set of strings. To describe a language, we describe the pattern of the strings in the set. For example, A = {a} {b} is the set of all strings that have 0 or more a's followed by 0 or more b's.

Pick the most specific correct answer. For example, consider a regular set that corresponds to all strings that start with an 'a' and end with a' b'. Given the options below, the correct answer would be option 3. Options 1 and 2 would not be correct because the strings have to satify both constraints, not just one of them.

Consider the following regular set over = {a, b}.

Which of the following correctly represents the language given by A? Explain your answer.

A={b}{a,b}{a} 1. Set of all strings that start with ' b ' 2. Set of all strings that end with ' a ' 3. Set of all strings that start with ' b ' and end with ' a ' 4. Set of all strings in 5. None of the above (provide your own answer and explanation.)