1) Consider the following BNF where is the start non-terminal nowing BNF where is the start non-terminal. Assume the terminal ident represents a nonempty sequence of letters. Similarly, the terminal number represents a non-empty sequence of digits. Symbols inside of single quotes represent those symbols as terminals. ::= '(^ ) | number | ident ::= , | a) Write EBNF rules for the language, eliminating any left recursion b) If possible, write a parse tree for the following: (plus, (minus, 5, 30), (min, time, distance), 7) If the language does not parse this string then write "not possible" and explain why. 1) Consider the following BNF where is the start non-terminal nowing BNF where is the start non-terminal. Assume the terminal ident represents a nonempty sequence of letters. Similarly, the terminal number represents a non-empty sequence of digits. Symbols inside of single quotes represent those symbols as terminals. ::= '(^ ) | number | ident ::= , | a) Write EBNF rules for the language, eliminating any left recursion b) If possible, write a parse tree for the following: (plus, (minus, 5, 30), (min, time, distance), 7) If the language does not parse this string then write "not possible" and explain why