Answered! The language of regular expression (0+10)* is the set of all strings of 0's and 1's such that every 1 is immediately…

The language of regular expression (0+10)* is the set of all strings of 0’s and 1’s such that every 1 is immediately followed by a 0. Describe the complement of this language (with respect to the alphabet {0,1}) and identify in the list below the regular expression whose language is the complement of L((0+10) *).

a) (0+1)*1(ε+1(0+1)*)

b) (0+1)*1(ε+11(0+1)*)

c) (0+10)*11(0+10)* + (0+1)*1

d) (0+10)*11(0+1)*

what is the answer and plz explain