consider following input sequence 01010101............
A) what will be regular expression to accept all prefixes of the given sequence__
1. 0(10)*
2. 0(01)*
3. 0(10)*+(01)*
4. 0*+(101)*
B) how many minimum number of state are required in a DFA for accepting the correct regular expression?
a.3
b.2
c.4
d.5