Consider the language L defined by the following grammar with productions S-> AB A -> a | Ab B-> b| Ba Which of the following statements are true for all sentences of L? Each sentence contains exactly as many a's as b's. Each sentence contains one or more b's. Each sentence contains at least two letters. O Each sentence contains one or more a's. O All as precede all b's.

Question 2 c) Give a regular expression for the following regular languages, assuming the alphabet is Σ := {0, 1}. I. The set of all strings, when viewed as binary representation of integers, that are divisible by 2. II. The set of all strings containing 00. III. Give a closed-form regular expression for the set of all string not containing consecutive 00.

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.