(10) If we list all permutations for n=1 as below. (1.2.3.4) (1.2.4.3) (1.3.2.4) (1.3.4.2) What can be said about how our sums from (8) and (9) compare. Think about this small collection of permutations for first (1.2.3.4) -1 +23 (1.2.4.3) -1 + 2/4 + 3 (1.3.2.4) -1 +32 + 4 (1.3.4.2) -1 +34 + 2 Once you review the details for n=4. see if you can make a more general statement about how the sum of a left hand half and right hand half compare when we consider all permutations for any given See below for a listing of how we can interpret the more general case. P: +2+...+P PAL+P9+2+...+ (8) Consider a list of the first n natural numbers randomly permuted (as described in question (3)) where is even Write an algorithm to determine the sum of the first values in the permutation. You can initialize the list manually to a permutation of choice as you develop the algorithm. As a response to the question, complete the below listed section labeled Implementation /Example for 8 //any possible permutation is valid int permutationil - 17.6.2.5.1,3,4,81 int sum - O: 1. Implementation / 19) Alter your answer for (8) to determine the sum of second collection of values in the permutation given your statically initialized list. (10) If we list all permutations for n=1 as below. (1.2.3.4) (1.2.4.3) (1.3.2.4) (1.3.4.2) What can be said about how our sums from (8) and (9) compare. Think about this small collection of permutations for first (1.2.3.4) -1 +23 (1.2.4.3) -1 + 2/4 + 3 (1.3.2.4) -1 +32 + 4 (1.3.4.2) -1 +34 + 2 Once you review the details for n=4. see if you can make a more general statement about how the sum of a left hand half and right hand half compare when we consider all permutations for any given See below for a listing of how we can interpret the more general case. P: +2+...+P PAL+P9+2+...+ (8) Consider a list of the first n natural numbers randomly permuted (as described in question (3)) where is even Write an algorithm to determine the sum of the first values in the permutation. You can initialize the list manually to a permutation of choice as you develop the algorithm. As a response to the question, complete the below listed section labeled Implementation /Example for 8 //any possible permutation is valid int permutationil - 17.6.2.5.1,3,4,81 int sum - O: 1. Implementation / 19) Alter your answer for (8) to determine the sum of second collection of values in the permutation given your statically initialized list