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*

To find the equivalent regular expression (RE) for the language of strings that contain exactly 4 1's, we can break down the problem step by step.

1. Start with the basic building blocks:

   • The regular expression "0*" represents any number of 0's.
   • The regular expression "1*" represents any number of 1's.

2. We need to ensure that there are exactly 4 1's in the string. We can achieve this by using the regular expression "1111".

3. Now, we need to combine the regular expressions from steps 1 and 2 to form the final RE. The options provided are: a. 010101010 b. (0+1)+(0+1)1(0+1)+(10101) c. ((0+1)10(0+1))+((0+1)01(0+1)) d. 1*(010101*)1*

4. Let's analyze each option: a. This option does not ensure that there are exactly 4 1's in the string. It allows for any number of 1's. b. This option allows for any combination of 0's and 1's, but it does not enforce the requirement of exactly 4 1's. c. This option allows for any combination of 0's and 1's, but it does not enforce the requirement of exactly 4 1's. d. This option enforces the requirement of exactly 4 1's by using the regular expression "010101*". However, it also allows for additional 1's before and after the required 4 1's.

5. Based on the analysis, the correct answer is option d. The equivalent regular expression for the language of strings that contain exactly 4 1's is 1*(010101*)1*.