The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1) is?

The regular expression denote a language comprising all possible stri

1.	The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1) is?
A.	1 + 0(1+0)*
B.	(0+1)(1+0)*
C.	(1+0)
D.	(00+0111+10)*
Answer» E.