Consider the following grammar G which generates language L(G). S→0A0 | 1A1…

Consider the following grammar G which generates language L(G).

S→0A0 | 1A1

A→0A | 1A | ϵ

Select the wrong option

A.
The given grammar generates all non-empty strings which begin and end with same symbol.
B.
The given grammar is CFG but language L(G) is regular.
C.
The min DFA which accept L(G) has 5 states
D.
The regular expression for L(G) is: 0(1+0)*0 + 1(0+1)*1

Attempted by 35 students.