Language is C++

(7) Consider two arrays of size n of type bool. Each array is randomly initialized to a collection of n Boolean values (either true or false). We want to write an algorithm that determines how many times both arrays are set to true at any given index. Let's say we have array A and array B as below. A = [@o][21]...(Qn1] B = [bo] [61]...[On-1) We want to check if a, and bo are both true, di and b, are both true, ..., finally, an and bn are both true. Which of the below for loops most effectively counts the number of indexes at which A and B are both true. (10) If we list all permutations for n = 4 as below. (1,2,3,4) (1,2,4,3) (1,3,2,4) (1,3,4,2) (4,3,2,1) What can be said about how our sums from (8) and (9) compare. Think about this small collection of permutations for n = 4 first (1,2,3,4) +1 +213 + 4 (1,2,4,3) + 1 + 24 + 3 (1,3,2,4) + 1 + 32 + 4 (1,3,4,2) +1+34 + 2 (4,3,2,1) + 4 + 32 + 1 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 n. See below for a listing of how we can interpret the more general case. P1 + P2 + ... +PA P4+1 +P+2+. + Pn