For each of the following languages, determine whether it is regular or not, and give a proof. To prove that a language is not regular, you should use the fooling set method. (To prove that a language is regular, you are allowed to use known facts about regular languages, e.g., closure properties, all finite languages are regular, . . . ) (a) {0 i1 j0 k : j is divisible by i + k, and i + j + k is divisible by 4, and i, j, k ≥ 5}.

Which of the following languages are regular?A = {x | x has two 0’s separated by the number of positions that is a multiple of 4 }.B = {x | x is binary representation of multiple of 3}.C = {x | x is a binary string and decimal of any prefix of x is not of form 3m + 2, where m ≥ 0}.Select one:a. All of the mentioned.b. Only B and C. c. Only A.d. Only B.

Which of the following is a regular language?

Which of the following is a Regular Language?~L={a^n b^ n |n>=0} =L={a^n b^ n |0=5}Select one:a. 1b. Lc. {a^n b^ n |n>

Select all true statements1 pointAll finite languages are regular.All infinite languages are regularAll infinite languages are context-free.All finite languages are context-free.

A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operationans.Kleene*All of the mentionedConcatenationUnion