Use the loop invariant (I) to show that the code below correctly computes n P−1 k=0 2k
(this sum represents the sum of the first n even integers where n ≥ 1).
Algorithm 1 evenSum(int n)
1: p = 2(n − 1)
2: i = n − 1
3: while i > 0 do
4: //(I) p = nP−1 k=i 2k
5: i − −
6: p = p + 2i
7: end while
8: return p
Prove the Base case of the loop invariant (I):

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