Consider the following two statements about regular languages:
: Every infinite regular language contains an undecidable language as a subset.
: Every finite language is regular.
Which one of the following choices is correct?
- AOnly is true.
- BOnly is true.
- CBoth and are true.
- DNeither nor is true.

