Let x and y be random variables that take on integer values from 0 to n, presented as the array of probabilities, i. e., x[i] will be the probability that x = i. you want to compute from these two arrays the distribution on x + y if x and y are independent. give an efficient algorithm for this problem. your algorithm should return an array of probabilities for x + y for possible integer values 0 to 2n. you can assume arithemtic operations take constant time.

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