L $=\{$w $\backslash$epsi $\{0,1\}*$: w$$#w$$#w$$ : where w$=$ w$\}$

Given a string w over some alphabet $\backslash$Sigma $,$ let w$$ be its reverse. For example, if w $=10110,$ then w$=01101.$

Let's say, we have the following $4$ CFGs labeled as $($A$)$ to $($C$).$

CFG A:

S $->1$S$0|0$S$1|$ #P#

P $->0$P $|1$P $|\backslash$epsi

CFG B:

S $->0$S $|1$S $|$ #P#

P $->0$P$0|1$P$1|\backslash$epsi

CFG C:

S $->0$S$0|1$S$1|$ #P#

P $->0$P $|1$P $|\backslash$epsi

What will be the correct CFG for the language L$?$

Note, for a language L$,$ the CFG will be correct if and only if it can parse all the strings, w in L$,$ and doesn$$t parse any string, w $$ L$.$

$*$

$2$ points

A

B

C