In: Computer Science
State whether each of the following is true or false. Justify your answer!
a. There are infinitely many finite languages.
b. Union of any two languages over alphabet {0, 1} is always regular.
c. The value of n3 +6n2 +5n is divisible by 6 for any integer n>0. Provide a proof.
d. Single state NFA can recognize only finite languages (languages with finitely many strings)
e. Intersection of any language and its complement is always regular.