Plz solve those questions.

Thank you

. AssignmentIdentifier [Expression] Expression Expression => Conjunction { " Conjunction } ConjunctionEquality && Equality EqualityRelation Equop Relation RelationAddition [ RelOp Addition Addition => Term { Addop Term } Term--> Factor { Mu10p Factor Factor => [ Una ry0p ] Primary Una ryop=>- I ! Primary => Identifier[ [Expression] } | Literal (Expression) I Type (Expression) Identifier => Letter { Letter | Digit } Digit => 0 | 1 | | 9 Literal --> Integer l Boolean | Float | Char InteregerDigit Digit h Figure 2.7 Syntax of Clite 1. Draw an abstract syntax tree for each of the parse trees that you defined for following exercise, use the syntax for Assignment given in in the eBNF above. (a) x=x+a-1; (b) a=b*c/d; 2. Prove that the following grammar is ambiguous: 3. Consider the following grammar: Which of the following sentences are in the language generated by this grammar? a. baab b. bbbab c. bbaaaaa d. bbaab 4. Consider the following grammar: Which of the following sentences are in the language generated by this grammar? a. abcd b. acccbd c. acccbcc d. acd e. accC 5. Write a grammar for the language consisting of strings that have n copies of the letter a followed by the same number of copies of the letter b, where n 0 For example, the strings ab, aaaabbbb, and aaaaaaaabbbbbbbb are in the language but a, abb, ba, and aaabb are not. 6. Convert the following EBNF to BNF: A a[b]A