G0 is a context-free grammar G 0 = ( V = { A } , ∑ = { 0 , 1 } , R , A ) whose rules are defined below:
A⟶A It is safe to say that G0 generates the empty set ϕ.
Group of answer choices
a. True
b. False