Let Σ={0,1} and L be the language of all strings with at least one 1 in their second half. Give both a CFG that generates L and a PDA that recognizes it.