Give context-free grammars that generate the following languages: σ = {0, 1}. What generates the language {w | w contains '11'}?
a) S → 1S | ε
b) S → 0S1 | ε
c) S → 1S0 | ε
d) S → 0S0 | ε