Thanks a lot:)

2. (10 points) A common misconception about regular languages is that if a language is regular, then its (a) Give an example of a regular language X that is a subset of all nonregular languages over . Briefly (b) Give an example of a regular language A and a nonregular language B such that A B. For this part, (c) Give an example of a nonregular language C and a regular language D such that C D. For this For each part of this problem, justify any claims you make about certain sets being regular or nonregular subsets or supersets must be too. In this question, you will show that this is false. Let = {0,1} justify your answer. (3 points) you must choose A and B that are neither equal to nor to . (3 points) part, you must choose C and D that are neither equal to nor to . (4 points) either by proving the claim from definitions or citing a fact proved in class/textbook. Created by Paint X