Language represented by Regular Expression

Question

L={w|the number of consecutive 1's in w is 0 or multiple of 4}

L is represented by which of following regular expression?

a)[(1111+1)*0*]*

b)(1111+10+0)*

c)(111*+10*)*

d)0*(111+1)*0*

Comments

it seems all options are wrong

option a. [(1111+1)*0*]*

= (1111+1+0)*   [as (P*Q*)* = (P+Q)*]

11111 will be in L but no of consecutive 1's is not multiple of 4

option b (1111+10+0)*

111110 will be in L but no of consecutive 1's is not multiple of 4

option c (111*+10*)*

111 will be in L but no of consecutive 1's is not multiple of 4

option d  0*(111+1)*0*

111 will be in  L but no of consecutive 1's is not multiple of 4

---

language should be (1111+0)* ..
any missing string ??

---

Yes