A. Describe L(G) in English.
A grammar G with V = {S, T, U}, Σ = {0, #}, and rules:
S → TT or UT
U → 0T or T0 or #
U → 0U00 or #
What is the language L(G) defined by this grammar?
a) The set of all strings containing two consecutive "0"s.
b) The set of all strings with an equal number of "0"s and "#" symbols.
c) The set of all strings starting and ending with "0".
d) The set of all strings with an even number of "0"s.