Let's analyze both statements step by step: --- ### **Statement S1** > Every infinite regular language contains an undecidable language as a subset. #### **Analysis:** - A regular language is always decidable by definition. - Any subset a regular language is not necessarily regular, but it **could** be any kind of language (regular, context-free, undecidable, etc.). - However, the *subset* of a regular language could be undecidable, but the statement says **every** infinite regular language contains an undecidable language as a subset. - This is **false** because, for example, the language \(L = \{a\}^*\) (all strings of 'a') is an infinite regular language, but every subset of L is either finite or countably infinite and can be decided by a Turing machine. In fact, there are infinite regular languages where all subsets are regular or at least decidable. --- ### **Statement S2** > Every finite language is regular. #### **Analysis:** - By definition, a finite language can be expressed by a finite automaton (simply enumerate all strings in the finite set). - Therefore, **every finite language is regular**. --- ### **Conclusion** - **S1 is false**, **S2 is true**. So, the correct answer is: ## **B: Only S2 is true**