Question 9 Consider the following FA. a a, b a, b a, b b Using Theorem 19 (on page 215) of Cohen to determine whether the FA above accepts a finite or infinite language, which one of the following would be correct? 1. Consider the word w = abbaabba. As this word is accepted by the FA, we can conclude that the language is infinite. 2. Consider the word w = aa. As this word is accepted by the FA, we can conclude that the language is infinite. 3. Consider the word w = baba. As this word is accepted by the FA, we can conclude that the language is finite. 11 4. Consider the word w = aaaa. As this word is accepted by the FA, we can conclude that the language is infinite