Please show me the steps of all parts of this question clearly and completely. Negative vote for incomplete or ambiguous answers.

1. Define context-free grammars a. (5 points) Write BNFIEBNF description for a Java class definition header statement. Examples of class definition header class MyClass abstract class MyClass final class MyClass extends Thread public class MyClass inplements Runnable Solution: b. (5 points) Write BNF/EBNF description for a C switch statement. A pseudo code example for such a statement is below switch (x) case : statementl: case x: statementx: default: statemento Hints: You can use non-terminal symbols such as cexpr> for expression, for values without defining them. Solution: HW2, Page 1/5 c. (5 points) Matching syntactic entities (e.g.. parentheses, brackets, or braces) is an important aspect of many programming languages. Define a context-free grammar in BNF capable of generating only balanced strings of (nested or flat) matched parentheses. The empty string is not in this language. For instance, the strings.000). (00)), and (00))) are sentences in this language, while the strings 0. 00. OX, and ((OO) are not. Note that not all strings with the same number of open and close parentheses are in this language (e.g., the strings )( and)(are not sentences in this language). Solution