Which of the following statements about regular languages is NOT true? (A) Every language has a regular superset (B) Every language has a regular subset (C) Every subset of a regular language is regular (D) Every subset of a finite language is regular Answer: (C) Explanation: Regular Languages are not closed under subset. Reference: https://courses.engr.illinois.edu/cs373/sp2009/handouts/closure/regular-closure.html Quiz of this QuestionPlease comment below if you find anything wrong in the above post