L $=\{$ w $\backslash$epsi $\{0,1\}*$: w in $\backslash$Sigma $*|$ every prefix of w has at least as many $0\text{'}$s as $1\text{'}$s $\}$

Clarification: L states "Every prefix of w contains equal or more $0$s than $1$s$."$

Select the correct CFG for L:

A$)$ S $->0$S$1$S $|0$S $|\backslash$epsi

B$)$ S $->$ SS $|0$S$1|1|\backslash$epsi

C$)$ S $->$ SS $|0$S$1|0|\backslash$epsi

D$)$ S $->0$S$1$S $|1$S $|\backslash$epsi

A prefix is a string consisting of several first letters of a given string, without any reorders. An empty prefix is also a valid prefix. For example, the string "abcd" has $5$ prefixes: empty string, $"$a$","$ab$",$ "abc" and "abcd".

$2$ points

a and d

a and b

a and c

a$,$ b and d

a$,$ b and c

a$,$ b$,$ c and d