Grammars and derivations (15 points): use the following production rules to determine whether or not each of the associated strings is valid. show the transformations or provide adequate explanation: n = {s, a, e) t = {a, b, e} start = 5 1. s--> a 2. a--> bse 3. a--> be 4. s--> e 5. e--> eea 6. e-> (a) aeaeaea (b) baeaea (c) is this grammar context-sensitive or context free and why?

Create a string list. 2. use console.readline() to collect values of firstname, lastname, street, city, state, zip, save them to list. 3. write a simple linq statement, call method uppercasewords() to change first letter to uppercase. 4. create a foreach statment to display the information. public static string uppercasewords(string value) { char[] array = value.tochararray(); if (array.length > = 1) { if (char.islower(array[0])) { array[0] = char.toupper(array[0]); } } for (int i = 1; i < array.length; i++) { if (array[i - 1] == ' ') { if (char.islower(array[i])) { array[i] = char.toupper(array[i]); } } } return new string(array);