Let = {0,1} and let B be the collection of strings that contain at least one

Let Σ = {0,1} and let B be the collection of strings that contain at least one 1 in their second half. In other words, B = {uv| u ∈ Σ^*, v ∈ Σ^*1 Σ^* and |u| ≥ |v|}.

a. Give a PDA that recognizes B.

b. Give a CFG that generates B.