Consider the CFG G given in problem $1.$ Suppose the pumping length for G is $5.$ Which of the following represents a valid way to break s $=0001110011$ into u$,$v$,$x$,$y$,$z according the the pumping lemma? In other words, if the v and y are "pumped", then the resulting string will always be in L$($G$).$ The choices do not need to be based on a parse tree $--$ just that uvixyiz in L for all i$>=0.$ Select all that apply.