I need help with NUMBER 10 PLEASE. That's the only question I need help with. I don't need help with 8 and 9. Thank you. Language C++

n 2 (8) Consider a list of the first n natural numbers randomly permuted (as described in question (3)) where n 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 n 8 //Any possible permutation is valid int permutation[] {7,6,2,5,1,3,4,8} int sum = 0; /** Implementation **/ (9) Alter your answer for (8) to determine the sum of second collection of values in the permutation given your statically initialized list. We want to check if ao and bo are both true, ai and b are both true, finally, an and bn are both true. (10) If we list all permutations for n = 4 as below. Which of the below for loops most effectively counts the number of indexes at which A and B are both true. (1,2,3,4) (1,2,4,3) (1,3,2,4) (1,3,4,2) (4,3,2,1) 0; i