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.

Select all regular expressions that are equivalent to (0+1)*1 point(0*1*)(1*0*)(0*1*)*(01)*(0*1)*(0*1)*0*

Give English descriptions of the language described by each of the following regularexpressions:1. (1 + ε) (00*1)*0*

what is equivalent RE of the language: the set of strings of 0's that contains exactly 4 1's Question 1Select one:a.0*10*10*10*10*b.(0+1)*+(0+1)*1(0+1)*+(1*01*01*)c.((0+1)*10(0+1)*)+((0+1)*01(0+1)*)d.1*(01*01*01*)1*

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.

You have a regular expression: (01 + 10)*. Which of the following strings is in the language defined by this regular expression?