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 nore concatenated copies of the string ab" would be the grammar: 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] b. The set of all strings consisting of one or more digits. Each digit is one of the characters 0 to 5 [12: 1.0 marks] 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 [12:2.2 marks] Outcome 6: Apply computer science theory and software development fundamentals to produce computing-based solutions. [Total marks 7.0 marks]