Answer Happy

Question 25:
Part a:
Let G=(V, T, S, P) be the phrase structure grammar with V={0, 1,
A, S}, the set of terminals T={0, 1} and the set of productions P
with
S->1S, S->01A, A->0A, A->0.
Select all the strings that belong to the language generated by
G.
Group of answer choices
0101
111101000
1010100
001000
Part b:
Let G=(V, T, S, P) be the phrase structure grammar with V={0, 1,
A, B, S}, the set of terminals T={0, 1} and the set of productions
P with
S->1A, S->0A, A->0B, B->1A, A->0.
Select all the strings that belong to the language generated by
G.
Group of answer choices
1010
0010100
00101
10111
Please answer all parts with full work shown, thank you!