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)*
The question was posed to me in final exam.
Origin of the question is Regular Grammar in portion Contextfree Grammar and Syntax Analysis of Compiler