Homework 1 Programming languages 1. Give a BNF grammar for each of the languages below: a. The set of all strings consisting of one or more as with a semicolon after each one b. The set of all strings consisting of one or more as, with a comma between each 'a' and the next. (There should be no comma before the first or after the last.) The set of all strings consisting of an open bracket (the symbol D followed by a list of one or more digits separated by commas, followed by a closing bracket (the symbol ) c. d. The set of all strings consisting of the keyword begin, followed by one or more statements with a semicolon after each one, followed by the keyword end 2. Using C++, write a short program that reverses the order of the words in a string. For instance, your function should transform the string "Do or do not, there is no try" to "try no is there, not do or Do". Assume that all words are space delimited and treat punctuation the same as letters