Consider the following two grammars with alphabet a and b i. (b*ab*a)*b* ii. (b*ab*a)*b*(b*ab*a)*b* Are there any strings are generated by one of the grammars and cannot be generated by the other? If there are more than one such string, how do you describe them.

NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Identify the productions of the phrase-structure grammar for each of these languages, where S is the starting symbol.     The set of all strings containing 10 or more 0s and no 1s   Multiple Choice A) S → A000000000, A → 0A,  and A → λ B) S → 00000A000000 and A → λ C) S → 0000000000A, A → 0A,  and A → λ

Can you please help me with this problem because I am struggling big time with this. I only need help with part D can you please show it step by step the context free solution part D. Can you please do it step by step leading up to the solution.Again I only need help with is with part D and only part D.

Can you please help me with this problem because I don't understand how to do this, can you please do it step by step and show something visual that shows why it is ambiguous or not and then can you explain in detail why it is ambiguous or not.