Let $G_1=(V,T,S,P)$ where

$V=\{0,1,S\}$

$T=\{0,1\}$

start symbol $S$

$P=\{S0S0,S1S1,S0,S1,S\}$

Choose which statement describes a language derived from this grammar

correctly:

Words of the language derived from this given grammar always start with $0.$

Words of the language derived from this given grammar always start with $1.$

Word can start with $0$ or $1$ but if it starts with $1$ it cannot end in $1$

Word can start with either $0$ or $1.$ If it starts at $0$ then it must end in $0.$