Hello i want answers for exercise 2 and 3 ( second pic) please

exercise 3 in langague c

Outcome 1: Analyze a complex computing problem and to apply principles of computing and other relevant disciplines to identify solutions. [Total marks 4.0 marks] Exercise1 Give a BNF grammar for each of the languages below. For example, a correct answer for "the set of all strings consisting of zero or more concatenated copies of the string ab" would be the grammar: S : : ab S Lempty a. The set of all strings consisting of one or more ' G 's, with a comma between each a and the next. There should be no comma before the first or after the last [1.2: 1.0 mark] :=aa, b. The set of all strings consisting of one or more digits. Each digit is one of the characters 0 to 5 [1.2: 1.0 marks] ::=::=012345 c. Phone number string: The sel of all strings starl with a hash sign (the symbol # ) followed by a list of one or more digits separated by commas [1.2: 2.0 marks] Outcome 6: Apply computer science theory and software development fundamentals to produce computing-based solutions. [Total marks 7.0 marks] Exercise 2 Give an EBNF for the languages in exercisel. Use the EBNF extensions whenever possible to simplify the grammar_[6.2; 4.0 marks] ::=012345 c. Phone number string: The set of all strings start with a hash sign (the symbol + ) followed by a list of one or more digits separated by commas [1.2: 2.0 marks] Outcome 6: Apply computer science theory and software development fundamentals to produce computing-based solutions. [Total marks 7.0 marks] Exercise2 Give an EBNF for the languages in exercisel. Use the EBNF extensions whenever possible to simplify the grammar [6.2: 4.0 marks] Exercise3 Give the syntax diagram for the language (c) in exercisel [6.2: 3.0 marks]