Assume the alphabet Σ = {0, 1}. Give three different regular expressions (besides the one given) that specify thelanguage described by this regular expression:((11)∗1∗)∗ + (11 + 1)∗ + (0 + ϵ)∗In each case, explain why your regular expression specifies the same language.Note: For the purposes of this exercise only, changing the order of a union does not count as a different regularexpression. Your examples also should not be more complicated than the original regular expr

For each of the following languages over the alphabet Σ = {a, b, c} specified by the regular expressions (a)–(c),provide two strings in Σ∗ that are members and two strings in Σ∗ that are not members of the language (fourstrings each).(a) ab + a(b) ((bc)∗ + b)a(c) (a + ab + abc)∗(b + c)

Write regular expressions for the following languages.1. the set of all alphabetic strings;2. the set of all lower case alphabetic strings ending in a b;3. the set of all strings from the alphabet a, b such that each a is immedi-ately preceded by and immediately followed by a b

Which language accepted by the regular expression (0+1)*0(0+1)*0(0+1)*.Select one:a. The set of all strings containing at least two 0’s.b. The set of all strings that begin and end with either 0 or 1.c. The set of all strings containing at most two 0’s.d. The set of all strings containing the substring 00.

A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operationans.UnionConcatenationAll of the mentionedKleene*This Question Is Marked For Review Previous Remove From Review Next

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.