I need help with the following programming language structure problems, thank you!

if you have any questions please specify!

A. Given the CFG with start symbol S. SSS[A] A AaAaB a BBbbb which of the following are part of the language of the grammar? (1 pt each) 1. aabzz 6. aabbba 2. abbzz 7. aa] 3. bzz 8. aaabaa] 4. aaabbb) a zzz 9. zzzaab) (aaabbb]z 5. aaabzz[a]] 10. az aabbb) aaa z B. A byte can hold unsigned decimal values in the range 0 to 255. Give a regular expression Il decimal values in this range, not allowing leading zeros. The empty string is not allowed. Legal strings are 0, 8, 144, 87, but not 350 or 017. (5 pts) C. Modify the expression grammar discussed in class to add as an exponentiation operator raise to power). It should have higher precedence than multiply, and as (That means a. b 2 + 3 will be evaluated as though it were written (a . (b* (c *2))) . 3.) (5 pts) Here's the expression grammar: expr - expr + term term term - term * prod prod prod id const(erpr) id a b c const 1 2 3