Define the optimization problem longest-path-length as the relation that associates each instance of an undirected graph and two vertices with the number of edges in a longest simple path between the two vertices. define the decision problem longest-path = {(g, u, v, k): g = (v, e) is an undirected graph, u, v element v, k greaterthanorequalto 0 is an integer, and there exists a simple path from u to v in g consisting of at least k edges}. show that the optimization problem longest-path-length can be solved in polynomial time if and only if longest-path element p.

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);