The given regular expression is (0+1)*(0+1) (0+1)*
After applying R*. R*=R* it becomes (0+1)(0+1)*
in (0+1)(0+1)* there is atleast one appearance of (0+1) hence we can write it as (0+1)^+
A={0,1,00,01,10,11,000,001,011,........} if draw DFA we need atleast 2 states so the answer is 2.